Search

Advances in computer image recognition have significantly impacted many industries, including healthcare, security and autonomous systems. This paper aims to explore the potential of improving image algorithms to enhance computer image recognition. Specifically, we will focus on regression methods as a means to improve the accuracy and efficiency of identifying images. In this study, we will analyze various regression techniques and their applications in computer image recognition, as well as the resulting performance improvements through detailed examples and data analysis. This paper deals with the problems related to visual image processing in outdoor unstructured environment. Finally, the heterogeneous patterns are converted into the same pattern, and the heterogeneous patterns are extracted from the fusion features of data modes. The simulation results show that the perception ability and recognition ability of outdoor image recognition in complex environment are improved. [ABSTRACT FROM AUTHOR]

This paper explores the different insider employee-led cyber frauds (IECF) based on the recent large-scale fraud events of prominent Indian banking institutions. Examining the different types of fraud and appropriate control measures will protect the banking industry from fraudsters. In this study, we identify and classify Cyber Fraud (CF), map the severity of the fraud on a scale of priority, test the mitigation effectiveness, and propose optimal mitigation measures. The identification and classification of CF losses were based on a literature review and focus group discussions with risk and vigilance officers and cyber cell experts. The CF was analyzed using secondary data. We predicted and prioritized CF based on machine learning-derived Random Forest (RF). An efficient fraud mitigation model was developed based on an offender-victim-centric approach. Mitigation is advised both before and after fraud occurs. Through the findings of this research, banks and fraud investigators can prevent CF by detecting it quickly and controlling it on time. This study proposes a structured, sustainable CF mitigation plan that protects banks, employees, regulators, customers, and the economy, thus saving time, resources, and money. Further, these mitigation measures will improve the reputation of the Indian banking industry and ensure its survival. [ABSTRACT FROM AUTHOR]

There has been a long history of research into the structure and evolution of mankind's scientific endeavor. However, recent progress in applying the tools of science to understand science itself has been unprecedented because only recently has there been access to high-volume and high-quality data sets of scientific output (e.g., publications, patents, grants) and computers and algorithms capable of handling this enormous stream of data. This article reviews major work on models that aim to capture and recreate the structure and dynamics of scientific evolution. We then introduce a general process model that aim to capture and recreate the structure and dynamics of scientific evolution. We then introduce a general process model that simultaneously grows coauthor and paper citation networks. The statistical and dynamic property of the networks generated by this model are validated against a 20-year data set of article published in PNAS. Systematic deviations from a power law distribution of citations to papers are well fit by a model that incorporates a partitioning of authors and papers into topics, a bias for authors to cite recent papers, and a tendency for authors to cite papers cited by papers, and a tendency for authors to cite papers cited by papers that they have read. In this TARL Model (for topics, aging, and recursive linking), the number of topics is linearly related to the clustering coefficient of the simulated paper citation network. [ABSTRACT FROM AUTHOR]

Background: This study is the first to address the topic of schematic versus realistic dynamic visualization with particular focus on the human movement effect (HME) when the content to be learned takes the form of a computer algorithm. An AlgoRythmics dance choreography illustration (HM‐realistic) was compared with an abstract computer animation (schematic). Previous research in the field of dynamic visualizations found schematic illustrations to be more effective, but the examined realistic representations did not include HME. Objectives: The objective of this study was to explore the process of comprehension of computer algorithms from these two types of representations (abstract animation vs. dance choreography illustration). Methods: The experiment (pre‐test, study phase, post‐test) involved 84 undergraduate students and included the following conditions (2 × 2 between‐participants‐design): HM‐realistic → HM‐realistic, schematic → schematic, HM‐realistic → schematic, schematic → HM‐realistic. Results and Conclusions: The results reveal that: (i) the group of participants who saw the dance choreography twice outperformed those who saw the computer animation twice; (ii) dance choreography illustration is only beneficial if it is presented as the second visualization. These findings are apparently contrary to the conclusions of some relevant previous research in the field, but they are in line with recent results regarding the HME. Takeaways: Realistic dynamic visualizations can be more effective than schematic ones if they involve human movement. To benefit maximally from realistic visualization, students need to have previously viewed it or to have previously viewed the isomorphic schematic presentation of it. Lay Description: What is already known about this topic: Studies that researched whether animation aids learners' understanding of dynamic phenomena have reported mixed results.When human movement is used to illustrate the learning content, dynamic visualizations have consistently proven to be superior to static visualizations.Various studies have explored dynamic visualizations under different combinations of schematic and/or realistic representations. Participants who were exposed exclusively to realistic animations exhibited significantly lower performance compared to their counterparts in the other conditions. What this paper adds: Realistic dynamic visualizations can be more effective than schematic ones if they involve human movement.This result is apparently contrary to the conclusions of some relevant previous research in the field of schematic versus realistic dynamic visualizations, but it is in line with recent findings regarding the so‐called human movement effect.To benefit maximally from realistic visualization, students need to have previously viewed it or to have previously viewed the isomorphic schematic presentation of it. Implications for practice and/or policy: The study provides a new insight into the research field of dynamic visualizations and valuable guidelines for instructional design. [ABSTRACT FROM AUTHOR]

Aiming at computer resources was limited and the total overhead of the system processing tasks was too high, this paper proposed an offloading strategy based on dynamic perception-hybrid artificial fish swarm（DP-HAFS） algorithm. First, it constructed a "local-edge-cloud" three-layer network architecture and adopted a fine-grained partial offloading mode; then, for the scenario where a terminal device covered by multiple base stations, this paper proposed a base station selection strategy to select the optimal base station; finally, it used the DP-HAFS algorithm to dynamically modify the unloading decision and got the best uninstall strategy. The simulation results show that the proposed offloading strategy can effectively reduce the total system overhead in a scenario with a large number of tasks. [ABSTRACT FROM AUTHOR]

With the advancement of artificial intelligence technology and computer hardware, the stereo matching algorithm has been widely researched and applied in the field of image processing. In scenarios such as robot navigation and autonomous driving, stereo matching algorithms are used to assist robots in acquiring depth information about the surrounding environment, thereby improving the robot's ability for autonomous navigation during self-driving. In this paper, we address the issue of low matching accuracy of stereo matching algorithms in specular regions of images and propose a multi-attention-based stereo matching algorithm called MANet. The proposed algorithm embeds a multi-spectral attention module into the residual feature-extraction network of the PSMNet algorithm. It utilizes different 2D discrete cosine transforms to extract frequency-specific feature information, providing rich and effective features for cost computation in matching. The pyramid pooling module incorporates a coordinated attention mechanism, which not only maintains long-range dependencies with directional awareness but also captures more positional information during the pooling process, thereby enhancing the network's representational capacity. The MANet algorithm was evaluated on three major benchmark datasets, namely, SceneFlow, KITTI2015, and KITTI2012, and compared with relevant algorithms. Experimental results demonstrated that the MANet algorithm achieved higher accuracy in predicting disparities and exhibited stronger robustness against specular reflections, enabling more accurate disparity prediction in specular regions. [ABSTRACT FROM AUTHOR]

The thermal management system is one of the important assemblies that ensure the secure operation of electric vehicles (EVs). Using intelligent algorithms to optimize the control strategy of the thermal management system can reduce energy consumption under the premise of effective heat dissipation of EVs. This paper attempts to construct the control strategy of EV thermal management system by coupling the modified genetic algorithm (MGA) and support vector regression (SVR). Firstly, the double-population adaptive mutation method and a novel optimization process are adopted to obtain MGA. Afterward, the performance of MGA is verified by four benchmark functions compared with three typical algorithms, which are genetic algorithm (GA), double-population genetic algorithm (DPGA), and quantum genetic algorithm (QGA). The results demonstrate that the accuracy and stability of MGA are obviously better than the other three algorithms. Secondly, MGA is applied to modify parameters of SVR kernel function, and the accuracy of MGA-SVR algorithm is verified by the Auto-MPG and Computer Hardware data sets. The mean square deviations of the SVR algorithm test set are 0.0186 and 0.0806, respectively, and the mean square deviations of the MGA-SVR algorithm test set are 0.0099 and 0.0054, respectively, which fully shows that MGA-SVR have more accurate forecasting capabilities. Finally, the thermal management system model of EV is built by the one-dimensional simulation software KULI. Under the Chinese working condition, fan speed which meets the cooling requirements of the motor and controller is obtained from the KULI model, and the database is constructed. Then, MGA-SVR is trained by database and employed to predict fan speed under the Chinese working condition and obtain control strategy of the thermal management system. Compared with traditional control strategy, the thermal management system based on MGA-SVR control strategy can not only meet the radiating requirements, but also effectively reduce the power consumption of fans. [ABSTRACT FROM AUTHOR]

With the rapid development of computer technology and electronic information technology, the sports training system no longer depends on the traditional algorithm for operation support, and various advanced posture algorithms are emerging. At the same time, it also further optimizes the intelligence and accuracy of the sports training algorithm. As an advanced algorithm combined with virtual reality technology, human posture estimation algorithm plays an obvious role in optimizing the effect of sports training. This paper will design a motion training system based on the optimized and improved human posture trajectory algorithm, use the depth image correlation theory to solve the problem of non-Gaussian noise crosstalk in the depth image of the traditional human posture algorithm in principle, improve the accurate feature extraction of the depth image by the algorithm, and solve the problem of human feature redundancy, so as to further improve the accuracy of the establishment of a single human model; on the problem of multi-person posture estimation algorithm, this paper proposes a high-resolution multi-person posture high-precision network model and adds the focus mechanism. Based on this, this paper realizes the high-precision and high-speed modeling of multi-person posture, so as to provide an accurate model for the multi-person function of sports training system and improve the efficiency of the algorithm. In the experimental part, this paper takes tennis as a typical case to design the sports training system and experiments based on the system designed in this paper. The experimental results show that the system under the proposed algorithm has obvious advantages in accuracy and training effect. [ABSTRACT FROM AUTHOR]

Background: The idea of computational thinking is underpinned by the belief that anyone can learn and use the underlying concepts of computer science to solve everyday problems. However, most studies on the topic have investigated the development of computational thinking through programming activities, which are cognitively demanding. There is a dearth of evidence on how computational thinking augments everyday problem solving when it is decontextualized from programming. Objectives: In this study, we examined how computational thinking, when untangled from the haze of programming, is demonstrated in everyday problem solving, and investigated the features of such solvable problems. Methods: Using a multiple case study approach, we tracked how seven university students used computational thinking to solve the everyday problem of a route planning task as part of an 8‐week‐long Python programming course. Results and Conclusions: Computational thinking practices are latent in everyday problems, and intentionally structuring everyday problems is valuable for discovering the applicability of computational thinking. Decomposition and abstraction are prominent computational thinking components used to simplify everyday problem solving. Implications: It is important to strike a balance between the correctness of algorithms and simplification of the process of everyday problem solving. Lay Description: What is already known about this topic: Computational thinking is a problem solving skill.Computational thinking is different from programming.There is dearth of evidence on how computational thinking augments everyday problem solving. What this paper adds: Computational thinking practices are latent in everyday problem solving.Intentional restructuring of problems is required to uncover how computational thinking applies in solving them. Implications for practices: Decomposition and abstraction are critical in solving everyday problems.Computational thinking should be taught explicitly through everyday problems.Finding balance between the correctness of algorithm and simplification of the problem solving process is important. [ABSTRACT FROM AUTHOR]

• A parallel scalable DBSCAN algorithm which outperforms other implementations. • Optimizations for data partitioning, spatial indexing, and cluster merging. • Exploiting hybrid parallelization to take advantage of modern HPC architectures. • Demonstrating accuracy, performance and scalability of our algorithm. Dbscan is a density-based clustering algorithm which is well known for its ability to discover clusters of arbitrary shape as well as to distinguish noise. As it is computationally expensive for large datasets, research studies on the parallelization of Dbscan have been received a considerable amount of attention. In this paper we present an exact, efficient and scalable parallel Dbscan algorithm which we call Hy-Dbscan. It employs three major techniques to enable scalable data clustering on distributed-memory computers i) a modified kd-tree for domain decomposition, ii) a spatial indexing approach based on grid and inference, and iii) a cluster merging scheme based on distributed Rem's Union-Find algorithm. Moreover, Hy-Dbscan exploits process level and thread level parallelization. In experiments, we have demonstrated performance and scalability using two scientific datasets on up to 2048 cores of a distributed-memory computer. Through extensive evaluation, we show that Hy-Dbscan significantly outperforms previous state-of-the-art Dbscan implementations. [ABSTRACT FROM AUTHOR]

The Jacobi iterative algorithm has the characteristic of low computational load, and multiple components of the solution can be solved independently. This paper applies these characteristics to the ternary optical computer, which can be used for parallel optimization because it has a large number of data bits and reconfigurable processor bits. Therefore, a new parallel design scheme is constructed to solve the problem of slow efficiency in solving large linear equations. And the elaborate experiment is used to verify. The experimental method is to simulate the calculation on the ternary optical computer experimental platform. Then, the resource consumption is numerically calculated and summarized to measure the feasibility of the parallel design. Eventually, the results show that the parallel design has obvious advantages in computing speed. The Jacobi iterative algorithm is optimized in parallel on ternary optical processor for the first time. There are two parallel highlights of the scheme. First, the n components are calculated in full parallel. Second, the modified signed-digit (MSD) multiplier based on the minimum module and one-step MSD adder are used to calculate each component to eliminate the impact of large amount of data on calculation time. The research provides a new method for fast solution of large linear equations. [ABSTRACT FROM AUTHOR]

Artificial fish swarm algorithm (AFS) is used in the field of function optimization problems widely. The traditional AFS algorithm has some problems such as long time to find the optimal solution and easy to fall into local optimality at the later stage of the search. We investigate design solutions and methods to implement parallel AFS algorithms by taking advantage of the large number of TOC processor bits and the easy scalability of processor bits. Firstly, we find out the parallel part of the algorithm by analyzing the traditional AFS algorithm and carry out the parallel design. Then we performed a detailed design of the algorithm implementation flow and analyzed the clock cycle. Finally, the correctness of our proposed parallel algorithm is verified on SD11. Compared with the serial AFS and parallel AFS algorithms based on electronic computers, the TOC-based AFS algorithm (TOC-PAFS) proposed in this paper effectively reduces the search time and improves the search performance of complex multi-peaked function optimization problems. [ABSTRACT FROM AUTHOR]

In order to solve the problem of complex event pattern in big data and strengthen research on key technologies of the Internet of Things and computer time matching algorithms, this paper studies the problem based on Hadoop clustering algorithm. Firstly, based on the subtype attribute of event type, the maximum value is selected as the final attribute value of the event after weighting the event. Secondly, cluster analysis is conducted on the Internet of Things flow dataset through the relationship between complex events. Finally, the simulation test is carried out on the simulation dataset of complex event relationship, and the simulation test of clustering algorithm comparison is carried out. The experimental results show that the clustering accuracy of different datasets is above 85%, and the clustering accuracy of causality reaches 96.07% when the dataset is 5G. Therefore, the algorithm proposed has high feasibility, good stability, and high speed and effectiveness for complex event processing. This study has certain practical significance for solving the problem of complex event pattern in big data. [ABSTRACT FROM AUTHOR]

This paper presents an in-depth study and analysis of the model of higher education using distributed hardware tracking intervention of information technology. The MEC-based dynamic adaptive video stream caching technology model is proposed. The model dynamically adjusts the bit rate by referring to the broadband estimation and cache occupancy data to ensure users have a smooth experience effect. Simulation results show that the model has fewer transcoding times and generates lower latency than the traditional model, which is suitable for dual-teacher classroom scenarios and further improves the quality of the user's video viewing experience. The model uses an edge cloud collaborative architecture to migrate the rendering technology to an edge server closer to the user side, enabling real-time interaction, computation, and rendering, reducing the time of data transmission as well as computation time. According to the blended learning-based adaptive intervention model, three rounds of teaching practice are conducted to validate the effectiveness of the intervention model in terms of both student process performance and outcome performance, thereby improving learning adaptability and improving learning effect. Teachers' teaching has a significant impact on learning motivation (β = 0.311 , p < 0.01), which in turn affects learning adaptability. Teachers use scientific teaching methods to stimulate students' learning motivation, mobilize enthusiasm, and improve learning adaptability. Under the communication topology of the system as a directed graph, a multi-intelligent system dynamic model with grouping is established; i.e., the intragroup intelligence has the same dynamics but is different between groups, and all system dynamics are unknown. The proposed novel policy iterative algorithm is used to learn the optimal control protocol and achieve optimal consistency control. The effectiveness of the algorithm is demonstrated by the simulation experimental results. The simulation results show that the model has lower latency and energy consumption compared to the cloud rendering model, which is suitable for the safety education classroom scenario and solves the outstanding problems of network connection rate and cloud service latency. [ABSTRACT FROM AUTHOR]

Object tracking is an important topic in computer visual directions, where scale changes, deformation and rotation are difficult to resolve in the field. For the challenging problems faced in the above track, based on existing Siamese network algorithms, this paper proposed multi-layer feature fusion and parallel self-attention Siamese networks (MPSiamRPN) for visual tracking. Firstly, MPSiamRPN used the modified ResNet50 to extract features from the template image and the search image. In order to deal with the loss of some features caused by the deep network, it proposed a multi-layer feature fusion module to fuse the features of the last three layers of ResNet. Secondly, it introduced the parallel self-attention module, which was composed of channel self-attention and spatial self-attention. The channel self-attention could selectively emphasize the beneficial channel features for tracking, and the spatial self-attention could learn the rich spatial information of the target. Finally, it proposed the region proposal network ( RPN) to perform classification and regression operations to determine the location and shape of the target. Experiments show that the MPSiamRPN can achieve competitive results on OTBlOO and VOT2018 test datasets. [ABSTRACT FROM AUTHOR]

Abstract: In this paper, the problem of providing a fully predictable execution environment for critical and hard real-time applications on embedded and DSP-based platforms is studied from the viewpoint of system architecture and operation. We introduce a set of homogenous models for time, signals and tasks, which will further serve as a basis for describing the architecture and operation of a particular hard real-time kernel – “HARETICK”. The kernel provides support for concurrent operation of hard real-time tasks (the HRT execution environment), using non-preemptive scheduling algorithms, along with soft real-time tasks (the SRT environment), using classical, preemptive, priority-based scheduling algorithms. A set of applications has been developed to test the correct operation of the HARETICK kernel according to the theoretical models and to evaluate its abilities to provide high predictability of execution for critical applications. Some of the main testing results are also discussed in the paper. [Copyright &y& Elsevier]

With the need to store a huge amount of personal information, Computer hardware has become extremely vital nowadays. However, some challenges follow this expansion; for instance, solving the problem of maintaining security challenges by using high-security algorithms. As a result, a high-security cryptosystem with low computation power is needed. One of the lattice-based cryptosystems that meet these requirements is NTRU. Since the NTRU cryptosystem proposal, many variants were proposed by researchers using different algebraic structures. In this paper, we design a new cryptosystem variant of NTRU, called BOTRU, which is a high-performing system based on bi-octonion subalgebra and it has good resistance to some well-known attacks, such as a brute force attack. The creation of two public keys in the system proposed has differentiated it from NTRU and NTRU like cryptosystems. Some arithmetic operations are used for comparing the efficiency of BOTRU with the OTRU cryptosystem. Based on arithmetic assessment, the comparison reveals that the BOTRU has a higher speed than the OTRU. [ABSTRACT FROM AUTHOR]

Computer vision-based recognition of Bangle vehicle license plates (LPs) is an arduous task in dirty and muddy situations. This paper proposes an efficient method for real-time computer vision-based recognition of Bangla vehicle LPs using contour analysis and prediction algorithms. The method initially applies gray scaling the input RGB images, histogram equalization to improve the grayscale image quality, edge detection using Sobel edge detector, and adaptive thresholding to convert it to a binary image. The system localizes the vehicle LP based on the maximum rectangular contour area and converts it into a predefined size. Noise removal technique using morphological dilation and erosion operation is used, followed by Gaussian filtering on binary image to improve the image quality further. The system clusters the two-lined LP into seven clusters. The sub-clustering is applied on specific clusters and makes 68 individual sub-clusters. The system extracts vector contour (VC) from each 68 individual classes. After VC extraction, the system normalizes it into a q predefined length. The system applies inter co-relation function (ICF) to categorize each sub-cluster to its previously defined individual class. For that, it calculates the maximum similarity between test and previously trained VCs. The system applies the dependency prediction algorithm in parallel to predict the whole string (district name) in the cluster-1 based on previously categorized class or classes (starting character or characters of the district part). (Metro) or (null) from cluster-2, "-" (hyphen) from cluster-3 and 6 are predicted automatically as their positions are fixed. The system is trained using 68 classes in which each class contains 100 samples generated by the augmentation technique. The system is tested using another set of 68 classes with a total of 6 8 × 1 0 0 = 6 8 0 0 images acquiring the recognition accuracy of 96.62% with the mean computational cost of 8.363 ms/f. The system is also tested using 500 vehicle whole Bangla LPs achieving the mean whole LP recognition accuracy of 95.41% with a mean computational cost of 35.803 ms/f. [ABSTRACT FROM AUTHOR]

In developing nations, many expanding cities are facing challenges that result from the overwhelming numbers of people and vehicles. Collecting real-time, reliable and precise traffic flow information is crucial for urban traffic management. The main purpose of this paper is to develop an adaptive model that can assess the real-time vehicle counts on urban roads using computer vision technologies. This paper proposes an automatic real-time background update algorithm for vehicle detection and an adaptive pattern for vehicle counting based on the virtual loop and detection line methods. In addition, a new robust detection method is introduced to monitor the real-time traffic congestion state of road section. A prototype system has been developed and installed on an urban road for testing. The results show that the system is robust, with a real-time counting accuracy exceeding 99% in most field scenarios. [ABSTRACT FROM AUTHOR]

In past, feedback in problem solving was found to improve human performance and focused mainly on learning applications. Interactive tools supporting decision-making and general problem-solving processes have long being developed to assist operations but not in optimization problem solving. Optimization problem solving is currently addressed within Operational Research (OR) through computational algorithms that aim to find the best solution in a problem (e.g. routing problem). Limited investigation there is on how computerized interactivity and metacognitive support (e.g. feedback and planning) can support optimization problem solving. This paper reports on human performance on Capacitated Vehicle Routing Problems (CVRPs) using paper-based problems and two different versions of an interactive computerized tool (one version with live explanatory and directive feedback alongside planning (strategy) support; one version without strategy support but with live explanatory feedback). Results suggest that human performance did not change when people were given paper-based post-problem feedback. On the contrary, participants' performance improved significantly when they used either version of the interactive tool that facilitated both live feedback support. No differences in performance across the two versions were observed. Implications on current theories and design implications for future optimization systems are discussed. [ABSTRACT FROM AUTHOR]

Smart cities wireless advertising (smart mobile-AD) filed is one of the well-known area of research where smart devices using mobile ad hoc networks (MANET) platform for advertisement and marketing purposes. Wireless advertising through multiple fusion internet of things (IoT) sensors is one of the important field where the sensors combines multiple sensors information and accomplish the control of self-governing intelligent machines for smart cities advertising framework. With many advantages, this field has suffered with data security. In order to tackle security threats, intrusion detection system (IDS) is adopted. However, the existing IDS system are not able to fulfill the security requirements. This paper proposes an intellectual characteristic selection algorithm (ICSA) integrated with normalized intelligent genetic algorithm-based min-max feature selection (NIGA-MFS). The proposed solution designs for wireless advertising system for business/advertising data security and other transactions using independent reconfigurable architecture. This approach supports the wireless advertising portals to manage the data delivery by using 4G standard. The proposed reconfigurable architecture is validated by using applications specific to microcontrollers with multiple fusion IoT sensors. [ABSTRACT FROM AUTHOR]

Proving or disproving an information inequality is a crucial step in establishing the converse results in coding theorems. However, an information inequality involving more than a few random variables is difficult to be proved or disproved manually. In 1997, Yeung developed a framework that uses linear programming for verifying linear information inequalities. Under the framework, this paper considers a few other problems that can be solved by using Lagrange duality and convex approximation. We will demonstrate how linear programming can be used to find an analytic proof of an information inequality or an analytic counterexample to disprove it if the inequality is not true in general. The way to automatically find a shortest proof or a smallest counterexample is explored. When a given information inequality cannot be proved, the sufficient conditions for a counterexample to disprove the information inequality are found by linear programming. Lastly, we propose a scalable algorithmic framework based on the alternating direction method of multipliers to accelerate solving a multitude of user-specific problems whose overall computational cost can be amortized with the number of users, and present its publicly-available software implementation for large-scale problems. [ABSTRACT FROM AUTHOR]

In this paper, a four-stage service model is constructed by combining M/M/1, MX/M/1 and M/MB/1 queuing systems. In addition, the immediate scheduling strategy and its algorithm are presented in detail, and the computing accomplished scheduling strategy and its algorithm are proposed. Approaches for computing the receiving time, preprocessing time, operating time and transmission time of operation requests that are based on various queuing systems are discussed, and the response time is calculated by adding these times together. Finally, the response times under the two scheduling strategies are obtained by simulating the models numerically, and the results demonstrate that the proposed computing accomplished scheduling strategy outperforms the immediate scheduling strategy. [ABSTRACT FROM AUTHOR]

We propose in this paper a new method processing the projection of an arbitrary size vector onto the probabilistic simplex or the ℓ 1 ball. Our method merges two principles. The first one is an original search of the projection using a bucket algorithm. The second one is a filtering, on the fly, of the values that cannot be part of the projection. The combination of these two principles offers a simple and efficient algorithm whose worst-case complexity is linear with respect to the vector size. Furthermore, the proposed algorithm exploits the representation of numeric values in digital computers to define the number of buckets and to accelerate the filtering. [ABSTRACT FROM AUTHOR]

An electronic health (e-health) system, such as a medical cyber-physical system, offers a number of benefits (e.g. inform medical diagnosis). There are, however, a number of considerations in the implementation of the medical cyber-physical system, such as the integrity of medical / healthcare data (e.g. manipulated data can result in misdiagnosis). A number of digital signature schemes have been proposed in recent years to mitigate some of these challenges. However, the security of existing signatures is mostly based on conventional difficult mathematical problems, which are known to be insecure against quantum attacks. In this paper, we propose a certificateless signature scheme, based on NTRU lattice. The latter is based on the difficulty of small integer solutions on the NTRU lattice, and is known to be quantum attack resilience. Security analysis and performance evaluations demonstrate that our proposed scheme achieves significantly reduced communication and computation costs in comparison to two other competing quantum resilience schemes, while being quantum attack resilience. [ABSTRACT FROM AUTHOR]

Retweeting is a powerful driving force in information propagation on microblogging sites. However, identifying the most effective retweeters of a message (called the ”key retweeter prediction” problem) has become a significant research topic. Conventional approaches have addressed this topic from two main aspects: by analyzing either the personal attributes of microblogging users or the structures of user graph networks. However, according to sociological findings, author-retweeter dependencies also play a crucial role in influencing message propagation. In this paper, we propose a novel model to solve the key retweeter prediction problem by incorporating the auxiliary relations between a tweet author and potential retweeters. Without loss of generality, we formulate the relations from four relational factors: status relation, temporal relation, locational relation, and interactive relation. In addition, we propose a novel method, called “Relation-based Learning to Rank (RL2R),” to determine the key retweeters for a given tweet by ranking the potential retweeters in terms of their spreadability. The experimental results show that our method outperforms the state-of-the-art algorithms at top-k retweeter prediction, achieving a significant relative average improvement of 19.7–29.4 percent. These findings provide new insights for understanding user behaviors on social media for key retweeter prediction purposes. [ABSTRACT FROM AUTHOR]

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. [ABSTRACT FROM AUTHOR]

In 2000, Babson and Steingrímsson generalized the notion of permutation patterns to the so-called vincular patterns, and they showed that many Mahonian statistics can be expressed as sums of vincular pattern occurrence statistics. STAT is one of such Mahonian statistics discovered by them. In 2016, Kitaev and the third author introduced a words analogue of STAT and proved a joint equidistribution result involving two sextuple statistics on the whole set of words with fixed length and alphabet. Moreover, their computer experiments hinted at a finer involution on R (w) , the rearrangement class of a given word w. We construct such an involution in this paper, which yields a comparable joint equidistribution between two sextuple statistics over R (w). Our involution builds on Burstein's involution and Foata–Schützenberger's involution that utilizes the celebrated RSK algorithm. [ABSTRACT FROM AUTHOR]

With the exponential growth in the capacity of information generated and the emerging need for data to be stored for prolonged period of time, there emerges a need for a storage medium with high capacity, high storage density, and possibility to withstand extreme environmental conditions. DNA emerges as the prospective medium for data storage with its striking features. Diverse encoding models for reading and writing data onto DNA, codes for encrypting data which addresses issues of error generation, and approaches for developing codons and storage styles have been developed over the recent past. DNA has been identified as a potential medium for secret writing, which achieves the way towards DNA cryptography and stenography. DNA utilized as an organic memory device along with big data storage and analytics in DNA has paved the way towards DNA computing for solving computational problems. This paper critically analyzes the various methods used for encoding and encrypting data onto DNA while identifying the advantages and capability of every scheme to overcome the drawbacks identified priorly. Cryptography and stenography techniques have been analyzed in a critical approach while identifying the limitations of each method. This paper also identifies the advantages and limitations of DNA as a memory device and memory applications. [ABSTRACT FROM AUTHOR]

Due to lack of a central bureaucrat in mobile ad hoc networks, the security of the network becomes serious issue. During malicious attacks, according to the motivation of intruder the severity of the threat varies. It may lead to loss of data, energy or throughput. This paper proposes a lightweight Intruder Node Detection and Isolation Action mechanism (INDIA) using feature extraction, feature optimization and classification techniques. The indirect and direct trust features are extracted from each node and the total trust feature is computed by combining them. The trust features are extracted from each node of MANET and these features are optimized using Particle Swarm Optimization (PSO) algorithm as feature optimization technique. These optimized feature sets are then classified using Neural Networks (NN) classifier which identifies the intruder node. The performance of the proposed methodology is studied in terms of various parameters such as success rate in packet delivery, delay in communication and the amount of energy consumption for identifying and isolating the intruder. [ABSTRACT FROM AUTHOR]

$\sf{ NTRUEncrypt}$  is one of the most promising candidates for quantum-safe cryptography. In this paper, we focus on the $\sf{ NTRU743}$  parameter set. We give a report on all known attacks against this parameter set and show that it delivers 256 bits of security against classical attackers and 128 bits of security against quantum attackers. We then present a parameter-dependent optimization using a tailored hierarchy of multiplication algorithms as well as the Intel AVX2 instructions, and show that this optimization is constant-time. Our implementation is two to three times faster than the reference implementation of $\sf{ NTRUEncrypt}$ . [ABSTRACT FROM AUTHOR]

Many plants originating from the Asteraceae family are applied as herbal medicines and also beverage ingredients in Asian areas, particularly in China. However, they may be confused due to their similar odor, especially when ground into powder, losing their typical macroscopic characteristics. In this paper, 11 different multiple mathematical algorithms, which are commonly used in data processing, were utilized and compared to analyze the electronic nose (E-nose) response signals of different plants from Asteraceae family. Results demonstrate that three-dimensional plot scatter figure of principal component analysis with less extracted components could offer the identification results more visually; simultaneously, all nine kinds of artificial neural network could give classification accuracies at 100%. This paper presents a rapid, accurate, and effective method to distinguish Asteraceae plants based on their response signals in E-nose. It also gives insights to further studies, such as to find unique sensors that are more sensitive and exclusive to volatile components in Chinese herbal medicines and to improve the identification ability of E-nose. Screening sensors made by other novel materials would be also an interesting way to improve identification capability of E-nose. [ABSTRACT FROM AUTHOR]

The question of which type of computer science (CS) publication-0conference or journal-0is likely to result in more citations for a published paper is addressed. A series of data sets are examined and joined in order to analyze the citations of over 195,000 conference papers and 108,000 journal papers. Two means of evaluating the citations of journals and conferences are explored: h5 and average citations per paper; it was found that h5 has certain biases that make it a difficult measure to use (despite it being the main measure used by Google Scholar). Results from the analysis show that CS, as a discipline, values conferences as a publication venue more highly than any other academic field of study. The analysis also shows that a small number of elite CS conferences have the highest average paper citation rate of any publication type, although overall, citation rates in conferences are no higher than in journals. It is also shown that the length of a paper is correlated with citation rate. [ABSTRACT FROM AUTHOR]

Background: Semantic approaches such as concept-based information retrieval rely on a corpus in which resources are indexed by concepts belonging to a domain ontology. In order to keep such applications up-to-date, new entities need to be frequently annotated to enrich the corpus. However, this task is time-consuming and requires a high-level of expertise in both the domain and the related ontology. Different strategies have thus been proposed to ease this indexing process, each one taking advantage from the features of the document. Results: In this paper we present USI (User-oriented Semantic Indexer), a fast and intuitive method for indexing tasks. We introduce a solution to suggest a conceptual annotation for new entities based on related already indexed documents. Our results, compared to those obtained by previous authors using the MeSH thesaurus and a dataset of biomedical papers, show that the method surpasses text-specific methods in terms of both quality and speed. Evaluations are done via usual metrics and semantic similarity. Conclusions: By only relying on neighbor documents, the User-oriented Semantic Indexer does not need a representative learning set. Yet, it provides better results than the other approaches by giving a consistent annotation scored with a global criterion-instead of one score per concept. [ABSTRACT FROM AUTHOR]

In a world where millions of people are dependent on batteries to provide them with convenient and portable energy, battery recycling is of the utmost importance. In this paper, we developed a new method to sort 18650 Lithium-ion batteries in large quantities and in real time for harvesting used cells with enough capacity for battery reuse. Internal resistance and capacity tests were conducted as a basis for comparison with a novel degradation-based method based on X-ray radiographic scanning and digital image contrast computation. The test results indicate that the sorting accuracy of the test cells is about 79% and the execution time of our algorithm is at a level of 200 milliseconds, making our method a potential real-time solution for reusing the remaining capacity in good used cells. [ABSTRACT FROM AUTHOR]

This paper models 1-out-of-N standby computing systems with a dynamic checkpointing policy. The system performs a real-time mission task that has to be accomplished within an allowed mission time. During the mission, to facilitate an effective failure recovery the system undergoes checkpointing procedures according to a policy that dynamically determines a checkpointing frequency based on the activated element and remaining work for completing the mission. System elements are heterogeneous; they can follow different, arbitrary types of time-to-failure distributions, have different performance and wait in different standby modes before their activation. A new numerical algorithm based on state space event transitions is first proposed to evaluate mission success probability of the real-time standby systems considered in this work. Additional new contributions are made by formulating and solving optimal dynamic checkpointing policy problems, as well as an integrated optimization problem that finds the optimal combination of checkpointing policy and element activation sequence maximizing mission success probability. Advantages of using the dynamic checkpointing policy over fixed even checkpoints are demonstrated through examples. Examples and results are also provided to illustrate effects of different mission and element parameters on mission success probability as well as on the optimal dynamic checkpointing policy. [ABSTRACT FROM AUTHOR]

Aim The objective of this paper is to identify attribute patterns of influential individuals in intensive care units using unsupervised cluster analysis. Background Despite the acknowledgement that culture of an organisation is critical to improving patient safety, specific methods to shift culture have not been explicitly identified. Methods A social network analysis survey was conducted and an unsupervised cluster analysis was used. Results A total of 100 surveys were gathered. Unsupervised cluster analysis was used to group individuals with similar dimensions highlighting three general genres of influencers: well-rounded, knowledge and relational. Conclusions Culture is created locally by individual influencers. Cluster analysis is an effective way to identify common characteristics among members of an intensive care unit team that are noted as highly influential by their peers. To change culture, identifying and then integrating the influencers in intervention development and dissemination may create more sustainable and effective culture change. Additional studies are ongoing to test the effectiveness of utilising these influencers to disseminate patient safety interventions. Implications for nursing management This study offers an approach that can be helpful in both identifying and understanding influential team members and may be an important aspect of developing methods to change organisational culture. [ABSTRACT FROM AUTHOR]

The scientific demand for more accurate modeling of the climate system calls for more computing power to support higher resolutions, inclusion of more component models, more complicated physics schemes, and larger ensembles. As the recent improvements in computing power mostly come from the increasing number of nodes in a system and the integration of heterogeneous accelerators, how to scale the computing problems onto more nodes and various kinds of accelerators has become a challenge for the model development. This paper describes our efforts on developing a highly scalable framework for performing global atmospheric modeling on heterogeneous supercomputers equipped with various accelerators, such as GPU (Graphic Processing Unit), MIC (Many Integrated Core), and FPGA (Field Programmable Gate Arrays) cards. We propose a generalized partition scheme of the problem domain, so as to keep a balanced utilization of both CPU resources and accelerator resources. With optimizations on both computing and memory access patterns, we manage to achieve around 8 to 20 times speedup when comparing one hybrid GPU or MIC node with one CPU node with 12 cores. Using a customized FPGA-based data-flow engines, we see the potential to gain another 5 to 8 times improvement on performance. On heterogeneous supercomputers, such as Tianhe-1A and Tianhe-2, our framework is capable of achieving ideally linear scaling efficiency, and sustained double-precision performances of 581 Tflops on Tianhe-1A (using 3750 nodes) and 3.74 Pflops on Tianhe-2 (using 8644 nodes). Our study also provides an evaluation on the programming paradigm of various accelerator architectures (GPU, MIC, FPGA) for performing global atmospheric simulation, to form a picture about both the potential performance benefits and the programming efforts involved. [ABSTRACT FROM AUTHOR]

Sometimes, in computer graphics, there is a need to show a part or a piece of a specific picture to study it accurately. For this purpose a window can be used to select the interested part of the picture for display out of other parts. This window is called a clipping window and this process is called a clipping process .On the other hand, clipping is required when a part of a moving image becomes out of the visible zone for display. So the clipping process is one of the important issues in the field of computer graphic specially for real time applications. Therefore a study of the line clipping with respect to a rectangular window while looking to various methods to achieve clipping process in the image space is presented in this paper. In addition to that, performance measurements are conducted and compared. The paper develops a method to perform clipping in the object space in which the line segment is clipped against a viewing volume. Finally, pipelining is adopted to realize clipping algorithm in hardware. [ABSTRACT FROM AUTHOR]

To achieve realistic Augmented Reality (AR), shadows play an important role in creating a 3D impression of a scene. Casting virtual shadows on real and virtual objects is one of the topics of research being conducted in this area. In this paper, we propose a new method for creating complex AR indoor scenes using real time depth detection to exert virtual shadows on virtual and real environments. A Kinect camera was used to produce a depth map for the physical scene mixing into a single real-time transparent tacit surface. Once this is created, the camera’s position can be tracked from the reconstructed 3D scene. Real objects are represented by virtual object phantoms in the AR scene enabling users holding a webcam and a standard Kinect camera to capture and reconstruct environments simultaneously. The tracking capability of the algorithm is shown and the findings are assessed drawing upon qualitative and quantitative methods making comparisons with previous AR phantom generation applications. The results demonstrate the robustness of the technique for realistic indoor rendering in AR systems. [ABSTRACT FROM AUTHOR]

Traditional "paper-and-pencil" testing is imprecise in measuring speed and hence limited in assessing performance efficiency, but computerized testing permits precision in measuring itemwise response time. We present a method of scoring performance efficiency (combining information from accuracy and speed) at the item level. Using a community sample of 9,498 youths age 8-21, we calculated item-level efficiency scores on 4 neurocognitive tests, and compared the concurrent, convergent, discriminant, and predictive validity of these scores with simple averaging of standardized speed and accuracy-summed scores. Concurrent validity was measured by the scores' abilities to distinguish men from women and their correlations with age; convergent and discriminant validity were measured by correlations with other scores inside and outside of their neurocognitive domains; predictive validity was measured by correlations with brain volume in regions associated with the specific neurocognitive abilities. Results provide support for the ability of itemwise efficiency scoring to detect signals as strong as those detected by standard efficiency scoring methods. We find no evidence of superior validity of the itemwise scores over traditional scores, but point out several advantages of the former. The itemwise efficiency scoring method shows promise as an alternative to standard efficiency scoring methods, with overall moderate support from tests of 4 different types of validity. This method allows the use of existing item analysis methods and provides the convenient ability to adjust the overall emphasis of accuracy versus speed in the efficiency score, thus adjusting the scoring to the real-world demands the test is aiming to fulfill. (PsycINFO Database Record [ABSTRACT FROM AUTHOR]