Loading [MathJax]/extensions/MathMenu.js
2022 Tenth International Symposium on Computing and Networking (CANDAR) - Conference Table of Contents | IEEE Xplore

International Symposium on Computing and Networking (CANDAR)

2022 Tenth International Symposium on Computing and Networking (CANDAR)

DOI: 10.1109/CANDAR57322.2022

21-24 Nov. 2022

Proceedings

The proceedings of this conference will be available for purchase through Curran Associates.

Computing and Networking (CANDAR), 2022 Tenth International Symposium on

Copyright

Publication Year: 2022,Page(s):1 - 1

Table of Contents

Publication Year: 2022,Page(s):v - vii

Conference Organizers: CANDAR 2022

Publication Year: 2022,Page(s):ix - x

Program Committee: CANDAR 2022

Publication Year: 2022,Page(s):xi - xiv

Reviewers: CANDAR 2022

Publication Year: 2022,Page(s):xv - xviii
Cellular automata have been a topic of great interest in unconventional computation theory for its architecture: simple but capable of producing complex structures with a dynamic behavior and massive parallel computation. Collision-based computing with multiple reactions is a way to explore such capacities. Following this logic, a virtual collider was proposed as a way to develop computers by usin...Show More
Inverse kinematics (IK) for a robotic arm solves for the joint variables to move its end-effector to a target position with an optional orientation. IK can be solved by iterative numerical methods. However, as the degree-of-freedom (DoF) of the robotic arm increases or the applications impose extra constraints, the iterative process will be lengthened dramatically. In this paper, we study the idea...Show More
We present a simple recurrence for the surface area of the ($n, k$) -star graph, $0 < k < n$, i.e., the number of nodes at a certain distance from the identity node in the graph, an important parameter for interconnection networks in parallel computing. The family of the ($n, k$) -star graphs includes several popular interconnection networks such as the star graph and the alternating group network...Show More
CYber PHysical Overlay Network over Internet Communication (CYPHONIC) has been proposed as a technology to achieve both communication connectivity and mobility transparency in IPv4/IPv6 mixed environment. Using CYPHONIC, applications running on nodes can achieve end-to-end encrypted communication over an overlay network. However, since CYPHONIC control messages use UDP port 4501, it may not be pos...Show More
We propose COFFEE, a Content Oriented Flexible Framework with Egress Engineering, improving client QoE in content delivery. BGP lacks visibility into performance, so they do not know which path maximizes the QoE of their content. COFFEE engineers egress paths based on the strategies formulated by content operators. Thus, it realizes performance-aware routing that reflects the characteristics of ea...Show More
With the advent of parallel processors for embedded systems, it is very important to design new runtime and system features so that embedded software developers can take advantage of the increased throughput and responsiveness without the hindrances of low-level synchronization and data sharing. In this paper, we design and implement a fully-prioritized, work-conserving, and event-driven parallel ...Show More
Quadratic Unconstrained Binary Optimization (QUBO) is a combinatorial optimization to find an optimal binary solution vector that minimizes the energy value defined by a quadratic formula of binary variables in the vector. As many NP problems can be reduced to QUBO problems, considerable research has gone into developing QUBO solvers running on various computing platforms such as quantum devices, ...Show More
Natural Gradient Descent (NGD) is a second-order neural network training that preconditions the gradient descent with the inverse of the Fisher Information Matrix (FIM). Although NGD provides an efficient preconditioner, it is not practicable due to the expensive computation required when inverting the FIM. This paper proposes a new NGD variant algorithm named Component-Wise Natural Gradient Desce...Show More
The group signature with message dependent opening (GS-MDO) is a valiant of the group signature in a sense that the opening authority is split into two parties called the opener and the admitter. Most known constructions of GS-MDO employ the static model. The only scheme using the dynamic model by Sun and Liu has a problem on the anonymity against the admitter in the real-world usage because the s...Show More
Object detection and tracking technology are essential in many ways with the increasing demand for remote video conferencing and video surveillance. This paper focuses on a method that combines an object detection method based on a CNN (Convolutional Neural Network) with a motion-vector-based object tracking method in specified frames instead of the whole frame stream. Although this method can imp...Show More
AI engines utilizing deep learning neural networks provide excellent tools for analyzing traditional board games. Here we are interested in gaining new insights into the ancient game of Go. For that purpose, we need to define new numerical measures based on the raw output of the engines. In this paper, we develop a numerical tool for automated move-by-move performance evaluation in a context-sensi...Show More
In photography, bokeh is the aesthetic effect appearing in out-of-focus areas. Bokeh is often used to emphasize a subject or to express a beautiful background. However, such bokeh effects can be expressed with cameras equipped with large-aperture lenses but are not easy to realize with small-aperture lenses. The main contribution of this paper is to propose a technique to generate a bokeh image fr...Show More
Pairing is carried out by two steps, Miller loop and final exponentiation. In this manuscript, the authors propose an efficient Miller loop for a pairing on the FK12 curve. A Hamming weight and bit-length of loop parameter have a great effect on the computational cost of Miller loop. Optimal-ate pairing is used as the most efficient pairing on the FK12 curve currently. The loop parameter of optima...Show More
The most efficient method for solving ECDLP is the Pollard-Rho method, which is known to be more efficient in solving ECDLP by using skew Frobenius mapping and splitting a seed-point table to eliminate the fruitless cycles, but some fruitless cycles increase non-negligibly. In this paper, we propose a method to further reduce the number of fruitless cycles in the Pollard's rho method using skew Fr...Show More
For interconnection networks of large-scale super-computers, it is reported that low-diameter randomized networks are effective in reducing network latency. Since these networks with irregular structures have many cyclic connections, deadlocks in packet routing lead to the deterioration of communication performance. This research proposes a dynamic routing reconfiguration method that can alter mul...Show More
Hotel booking sites provide evaluations, including textual reviews and numerical ratings by hotel guests. However, some evaluations are without numerical ratings, and there are some inconsistent evaluations between textual reviews and numerical ratings (e.g., a positive review text is posted along with low ratings). Such evaluations may confuse site users. To resolve such problems, we propose a hi...Show More
Encryption of communication is essential for secure data exchange in wireless LANs. Kr00k was proposed as a new attack method for wireless LANs in 2020. This attack method can decrypt packets using the specifications of the encryption keys employed for communication. However, assuming an actual real-time environment, the probability of a successful attack is infinitesimally low and has no practica...Show More

Proceedings

The proceedings of this conference will be available for purchase through Curran Associates.

Computing and Networking (CANDAR), 2022 Tenth International Symposium on