3,032 research outputs found
Digital Game Prototyping Using Board Game/Table Top as it’s Mock Up Case Study: Taman Putroe Phang Game Project
Many of the games with the Indonesian culture adaptations has been developed nowadays. Some of them
are made for commercial markets and the other still developed as portfolio and also academic purposes. Some
games, already had great gameplay and also had some beautifully digitalized artwork. However, in academic level
games projects such as communications designs student’s final projects games prototyping, they often show many
errors in the process, especially at gameplay and asset’s development. This circumstances happened because they
(the students) lack of the knowledge about how to make a good gameplay based on narrations and always concern
about how to designing the visual contents than make it have a great game. With the qualitative research methods by
analyzing a games’ project called Taman Putroe Phang, a game project which adapting the Aceh’s Kingdom
Romance History. Using game development theory and game design theories, this research wants to explain about
how the game developed using board game/ tabletop prototyping before go to the digitalized final game design. The
research purpose is to give a perspective and helps the beginner game designer to make a success game prototype
using the table top mock up at the process, that shown in game’s prototype.
Keyword: Games, Games’ mock up, table top game, board game, Aceh’s Kingdom Histor
Diffusive Molecular Communication with Nanomachine Mobility
This work presents a performance analysis for diffusive molecular
communication with mobile transmit and receive nanomachines. To begin with, the
optimal test is obtained for symbol detection at the receiver nanomachine.
Subsequently, closed-form expressions are derived for the probabilities of
detection and false alarm, probability of error, and capacity considering also
aberrations such as multi-source interference, inter-symbol interference, and
counting errors. Simulation results are presented to corroborate the
theoretical results derived and also, to yield various insights into the
performance of the system. Interestingly, it is shown that the performance of
the mobile diffusive molecular communication can be significantly enhanced by
allocating large fraction of total available molecules for transmission as the
slot interval increases.Comment: To be submitted in 52th Annual Conference on Information Sciences and
Systems (CISS
Cognitive MIMO-RF/FSO Cooperative Relay Communication with Mobile Nodes and Imperfect Channel State Information
This work analyzes the performance of an underlay cognitive radio based
decode-and-forward mixed multiple-input multiple-output (MIMO) radio
frequency/free space optical (RF/FSO) cooperative relay system with multiple
mobile secondary and primary user nodes. The effect of imperfect channel state
information (CSI) arising due to channel estimation error is also considered at
the secondary user transmitters (SU-TXs) and relay on the power control and
symbol detection processes respectively. A unique aspect of this work is that
both fixed and proportional interference power constraints are employed to
limit the interference at the primary user receivers (PU-RXs). Analytical
results are derived to characterize the exact and asymptotic outage and bit
error probabilities of the above system under practical conditions of node
mobility and imperfect CSI, together with impairments of the optical channel,
such as path loss, atmospheric turbulence, and pointing errors, for orthogonal
space-time block coded transmission between each SU-TX and relay. Finally,
simulation results are presented to yield various interesting insights into the
system performance such as the benefits of a midamble versus preamble for
channel estimation.Comment: revision submitted to IEEE Transactions on Cognitive Communications
and Networkin
Masses of Third Family Vector-like Quarks and Leptons in Yukawa-Unified
In supersymmetric the masses of the third family quarks and charged
lepton, , as well as the masses of the vector-like quarks and
leptons, and , may arise from the coupling x
x , where and denote the third family matter and
Higgs multiplets respectively. We assume that the SO(10) singlet component in
acquires a TeV scale VEV which spontaneously breaks U(1) and
provides masses to the vector-like particles in , while the MSSM doublets
in provide masses to and . Imposing Yukawa coupling
unification at and employing the ATLAS and
CMS constraints on the boson mass, we estimate the lower bounds on
the third family vector-like particles and masses to be
around 5.85 TeV and 2.9 TeV respectively. These bounds apply in the
supersymmetric limit.Comment: 10 pages, 4 figure
False Discovery Rate Based Distributed Detection in the Presence of Byzantines
Recent literature has shown that the control of False Discovery Rate (FDR)
for distributed detection in wireless sensor networks (WSNs) can provide
substantial improvement in detection performance over conventional design
methodologies. In this paper, we further investigate system design issues in
FDR based distributed detection. We demonstrate that improved system design may
be achieved by employing the Kolmogorov-Smirnov distance metric instead of the
deflection coefficient, as originally proposed in Ray&VarshneyAES11. We also
analyze the performance of FDR based distributed detection in the presence of
Byzantines. Byzantines are malicious sensors which send falsified information
to the Fusion Center (FC) to deteriorate system performance. We provide
analytical and simulation results on the global detection probability as a
function of the fraction of Byzantines in the network. It is observed that the
detection performance degrades considerably when the fraction of Byzantines is
large. Hence, we propose an adaptive algorithm at the FC which learns the
Byzantines' behavior over time and changes the FDR parameter to overcome the
loss in detection performance. Detailed simulation results are provided to
demonstrate the robustness of the proposed adaptive algorithm to Byzantine
attacks in WSNs.Comment: 28 pages, 9 figures, to appear in IEEE Transactions on Aerospace and
Electronic System
Enabling Trust in Deep Learning Models: A Digital Forensics Case Study
Today, the volume of evidence collected per case is growing exponentially, to
address this problem forensics investigators are looking for investigation
process with tools built on new technologies like big data, cloud services, and
Deep Learning (DL) techniques. Consequently, the accuracy of artifacts found
also relies on the performance of techniques used, especially DL models.
Recently, \textbf{D}eep \textbf{N}eural \textbf{N}ets (\textbf{DNN}) have
achieved state of the art performance in the tasks of classification and
recognition. In the context of digital forensics, DNN has been applied to the
domains of cybercrime investigation such as child abuse investigations, malware
classification, steganalysis and image forensics. However, the robustness of
DNN models in the context of digital forensics is never studied before. Hence,
in this research, we design and implement a domain-independent Adversary
Testing Framework (ATF) to test the security robustness of black-box DNN's. By
using ATF, we also methodically test a commercially available DNN service used
in forensic investigations and bypass the detection, where published methods
fail in control settings.Comment: 6 pages, Presented at 17th IEEE International Conference On Trust,
Security And Privacy In Computing And Communications 201
Distributed Inference in Tree Networks using Coding Theory
In this paper, we consider the problem of distributed inference in tree based
networks. In the framework considered in this paper, distributed nodes make a
1-bit local decision regarding a phenomenon before sending it to the fusion
center (FC) via intermediate nodes. We propose the use of coding theory based
techniques to solve this distributed inference problem in such structures. Data
is progressively compressed as it moves towards the FC. The FC makes the global
inference after receiving data from intermediate nodes. Data fusion at nodes as
well as at the FC is implemented via error correcting codes. In this context,
we analyze the performance for a given code matrix and also design the optimal
code matrices at every level of the tree. We address the problems of
distributed classification and distributed estimation separately and develop
schemes to perform these tasks in tree networks. The proposed schemes are of
practical significance due to their simple structure. We study the asymptotic
inference performance of our schemes for two different classes of tree
networks: fixed height tree networks, and fixed degree tree networks. We show
that the proposed schemes are asymptotically optimal under certain conditions.Comment: 16 pages, 7 figures, submitted to IEEE Transactions on Signal
Processin
Diffusion Based Cooperative Molecular Communication in Nano-Networks
This work presents a novel diffusion based dual-phase molecular communication
system where the source leverages multiple cooperating nanomachines to improve
the end-to-end reliability of communication. The Neyman-Pearson Likelihood
Ratio Tests are derived for each of the cooperative as well as the destination
nanomachines in the presence of multi-user interference. Further, to
characterize the performance of the aforementioned system, closed form
expressions are derived for the probabilities of detection, false alarm at the
individual cooperative, destination nanomachines, as well as the overall
end-to-end probability of error. Simulation results demonstrate a significant
improvement in the end-to-end performance of the proposed cooperative framework
in comparison to multiple-input single-output and single-input single-output
molecular communication scenarios in the existing literature.Comment: Revised IEEE WCL Draft (in review process
Passive scalar mixing and decay at finite correlation times in the Batchelor regime
An elegant model for passive scalar mixing was given by Kraichnan assuming
the velocity to be delta-correlated in time. We generalize this model to
include the effects of a finite correlation time, , using renewing flows.
The resulting equation for the 3-D passive scalar spectrum or
its correlation function , gives the Kraichnan equation when , and extends it to the next order in . It involves third and fourth
order derivatives of or (in the high limit). For
small-, it can be recast using the Landau-Lifshitz approach, to one with
at most second derivatives of . We present both a scaling solution to
this equation neglecting diffusion and a more exact solution including
diffusive effects. We show that the steady state 1-D passive scalar spectrum,
preserves the Batchelor form, , in the
viscous-convective limit, independent of . This result can also be
obtained in a general manner using Lagrangian methods. Interestingly, in the
absence of sources, when passive scalar fluctuations decay, we show that the
spectrum in the Batchelor regime and at late times, is of the form and also independent of . More generally, finite
does not qualitatively change the shape of the spectrum during decay, although
the decay rate is reduced. From high resolution () direct numerical
simulations of passive scalar mixing and decay, We find reasonable agreement
with predictions of the Batchelor spectrum, during steady state. The scalar
spectrum during decay agrees qualitatively with analytic predictions when power
is dominantly in wavenumbers corresponding to the Batchelor regime, but is
however shallower when box scale fluctuations dominate during decay (abridged).Comment: 32 pages, 7 figures, Journal Of Fluid Mechanics (In Press
Design and Performance Analysis of Dual and Multi-hop Diffusive Molecular Communication Systems
This work presents a comprehensive performance analysis of diffusion based
direct, dual-hop, and multi-hop molecular communication systems with Brownian
motion and drift in the presence of various distortions such as inter-symbol
interference (ISI), multi-source interference (MSI), and counting errors.
Optimal decision rules are derived employing the likelihood ratio tests (LRTs)
for symbol detection at each of the cooperative as well as the destination
nanomachines. Further, closed-form expressions are also derived for the
probabilities of detection, false alarm at the individual cooperative,
destination nanomachines, as well as the overall end-to-end probability of
error for source-destination communication. The results also characterize the
impact of detection performance of the intermediate cooperative nanomachine(s)
on the end-to-end performance of dual/multi hop diffusive molecular
communication systems. In addition, capacity expressions are also derived for
direct, dual-hop, and multi-hop molecular communication scenarios. Simulation
results are presented to corroborate the theoretical results derived and also,
to yield insights into system performance.Comment: in preparatio
- …