ppxscal/embedding_network huggingface dataset:
Performance-Directed iSCSI Security with Parallel Encryption
Authors: Bo Mao, Dan Feng, Suzhen Wu, Jianxi Chen, Lingfang Zeng
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications (2008)

iSCSI has been paid much attention since it allows the storage data to be transported over the popular TCP/IP networks and takes advantage of the networks. Carrying data over the TCP/IP networks introduces the security problem. The IP security mechanisms, such as IPSec, always degrade the performance greatly. In this paper we introduced a parallel encryption method, combined with the IPSec AH, to provide the security and high performance for the iSCSI storage system. We have implemented parallel encryption with IPSec AH in the UNH iSCSI software. Numerical results using popular benchmark program and OLTP traces have shown dramatic performance gain and the average response time reduced greatly.
An error-counting network for pattern classification
Authors: Kar-Ann Toh
Venue: Neurocomputing (2008)

This paper presents a novel quadratic error-counting network for pattern classification. Two computational issues namely, the network learning issue and the classification error-counting issue have been addressed. Essentially, a linear series functional approximation to network structure and a smooth quadratic error-counting cost function were proposed to resolve these two computational issues within a single framework. Our analysis shows that the quadratic error-counting objective can be related to the least-squares-error objective by adjusting the class-specific normalization factors. The binary classification network is subsequently extended to cater for multicategory problems. An extensive empirical evaluation validates the usefulness of proposed method.
Design and Implementing an Integrated Learning Content Management System
Authors: Zhou Xiang
Venue: Proceedings of the First International Workshop on Knowledge Discovery and Data Mining (2008)

An LCMS is aimed at managing learning content which is typically stored in a database. It must include these six features: learning content creation, publishing, content management function, presentation, communication & collaboration function and standard compliant. An LCMS provides many essential benefits to e-Learning, but the current system architecture has some disadvantages. The authors analyzed these disadvantages and proposed an integrated LCMS (ILCMS) framework. The new framework evolves from local to global. It starts with a local system for local users, and then connects with other local systems to build the broader network.
The North Carolina State Government Website Archives: A case study of an American government Web archiving project
Authors: Kristin E. Martin, Kelly Eubank
Venue: The New Review of Hypermedia and Multimedia (2007)

The North Carolina State Archives and State Library of North Carolina collaborated to develop the North Carolina State Government Website Archives, a collection of captured government websites dating back to the fall of 2005 and available to the public for research. This paper explores the process by which the Web archives were developed-from the methodology of how to collect information on the Web through the selection process for determining material to be included in the Web archives and the choice of Archive-It, a service available through the Internet Archive, as the technology for running the Web archives. Challenges in the development and deployment of the Web archives are discussed, including controlling the growth of material captured, the capture of unwanted content, managing robots.txt exclusions, and educating state agencies about the importance of websites as government records. The Web archives are available at http://www.ah.dcr.state.nc.us/archives/webarchives/index.html
Self-Motions of General 3-RPR Planar Parallel Robots
Authors: Sébastien Briot, Vigen Arakelian, Ilian A. Bonev, Damien Chablat, Philippe Wenger
Venue: International Journal of Robotics Research (2008)

We study 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 behavior 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.
A Statistical Approach to Volume Data Quality Assessment
Authors: Chaoli Wang, Kwan-Liu Ma
Venue: IEEE Transactions on Visualization and Computer Graphics (2008)

Quality assessment plays a crucial role in data analysis. In this paper, we present a reduced-reference approach to volume data quality assessment. Our algorithm extracts important statistical information from the original data in the wavelet domain. Using the extracted information as feature and predefined distance functions, we are able to identify and quantify the quality loss in the reduced or distorted version of data, eliminating the need to access the original data. Our feature representation is naturally organized in the form of multiple scales, which facilitates quality evaluation of data with different resolutions. The feature can be effectively compressed in size. We have experimented with our algorithm on scientific and medical data sets of various sizes and characteristics. Our results show that the size of the feature does not increase in proportion to the size of original data. This ensures the scalability of our algorithm and makes it very applicable for quality assessment of large-scale data sets. Additionally, the feature could be used to repair the reduced or distorted data for quality improvement. Finally, our approach can be treated as a new way to evaluate the uncertainty introduced by different versions of data.
An Efficient Cross-Layer Based Flooding Algorithm with Retransmission Node Selection for Wireless Sensor Networks
Authors: Seung-Joon Choi, Ki-Hyuk Kwon, Sang-Jo Yoo
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications - Workshops (2008)

In this paper, we propose a flooding algorithm with retransmission node selection (FARNS) for wireless sensor networks. It is an efficient cross-layer based flooding technique to solve a broadcast storm problem that is produced by simple flooding of nodes in wireless sensor networks. FARNS can decrease waste of unnecessary energy by controlling retransmission action of whole network nodes by deciding retransmission candidate nodes that are selected by identifier information of neighbor nodes in MAC and distance with neighborhood nodes through received signal strength information in PHY. In simulation results show that FARNS has excellent performance than the other flooding schemes in terms of broadcast forwarding ratio, broadcast delivery ratio, and the number of redundancy packets and overhead.
A residual based error estimator using radial basis functions
Authors: Bernard B. T. Kee, G. R. Liu, G. Y. Zhang, C. Lu
Venue: Finite Elements in Analysis and Design (2008)

In this paper, a novel residual based error estimator using radial basis functions (RBFs) is proposed. The error estimator evaluates the residual in the strong-form governing equation in the local domain through direct integration. Due to the higher order continuous feature of the RBFs, the higher derivatives of the field function in the strong-form governing equation can be obtained using RBFs. The numerical examples show that the new residual based error estimator is simple, versatile robust and yet effective in the adaptive analyses. It is not only suitable for adaptive analysis that uses numerical method formulated based on mesh, e.g. finite element method, but also meshfree methods where the conventional residual based and recovery based error estimator cannot be used. Furthermore the present error estimator is also feasible for numerical method that is formulated based on both strong and weak formulation in the adaptive analyses.
MPI Collectives on Modern Multicore Clusters: Performance Optimizations and Communication Characteristics
Authors: Amith R. Mamidala, Rahul Kumar, Debraj De, D. K. Panda
Venue: Proceedings of the 2008 Eighth IEEE International Symposium on Cluster Computing and the Grid (2008)

The advances in multicore technology and modern interconnects is rapidly accelerating the number of cores deployed in today's commodity clusters. A majority of parallel applications written in MPI employ collective operations in their communication kernels. Optimization of these operations on the multicore platforms is the key to obtaining good performance speed-ups. However, designing these operations on the modern multicores is a non-trivial task. Modern multicores such as Intel's Clovertown and AMD's Opteron feature various architectural attributes resulting in interesting ramifications. For example, Clovertown deploys shared L2 caches for a pair of cores whereas in Opteron, L2 caches are exclusive to a core. Understanding the impact of these architectures on communication performance is crucial to designing efficient collective algorithms. In this paper, we systematically evaluate these architectures and use these insights to develop efficient collective operations such as MPI_Bcast, MPI_Allgather, MPI_Allreduce and MPI_Alltoall. Further, we characterize the behavior of these collective algorithms on multicores especially when concurrent network and intra-node communications occur. We also evaluate the benefits of the proposed intra-node MPI_Allreduce over Opteron multicores and compare it with Intel Clovertown systems. The optimizations proposed in this paper reduce the latency of MPI_Bcast and MPI_Allgather by 1.9 and 4.0 times, respectively on 512 cores. For MPI_Allreduce, our optimizations improve the performance by as much as 33\% on the multicores. Further, we observe upto three times improvement in performance for matrix multiplication benchmark on 512 cores.
Audit and backup procedures for hardware security modules
Authors: Túlio Cicero Salvaro de Souza, Jean Everson Martina, Ricardo Felipe Custódio
Venue: Proceedings of the 7th symposium on Identity and trust on the Internet (2008)

Hardware Security Modules (HSMs) are an useful tool to deploy public key infrastructure (PKI) and its applications. This paper presents necessary procedures and protocols to perform backup and audit in such devices when deployed in PKIs. These protocols were evaluated in an implementation of a real HSM, enabling it to perform secure backups and to provide an audit trail, two important considerations for a safe PKI operation. It also introduces a ceremony procedure to support the operation of such HSMs in a PKI environment.
Back propagation neural network based modeling of multi-responses of an electrical discharge machining process
Authors: Debabrata Mandal, Surjya K. Pal, Partha Saha
Venue: International Journal of Knowledge-based and Intelligent Engineering Systems (2007)

This work attempts to model the electrical discharge machining (EDM) process using artificial neural network (ANN) with back propagation as the learning algorithm. The three most important parameters, namely, material removal rate (MRR), tool wear and surface roughness have been considered as a measure of the process performance. A large number of experiments have been carried out over a wide range of machining conditions to study the effect of input parameters on the machining performance. The experimental data is used for the training and verification of the model. Testing results demonstrate that the model is suitable for predicting the response parameters accurately.
CaDAnCE: A Criticality-Aware Deployment and Configuration Engine
Authors: Gan Deng, Douglas C. Schmidt, Aniruddha Gokhale
Venue: Proceedings of the 2008 11th IEEE Symposium on Object Oriented Real-Time Distributed Computing (2008)

Predictable deployment and configuration (D&C) of components in response to dynamic environmental changes or system mode changes is essential for ensuring open distributed real-time and embedded (DRE) system real-time QoS. This paper provides three contributions to research on the predictability of D&C for component-based open DRE systems. First, we describe how the dependency relationships among different components and their criticality levels can cause deployment order inversion of tasks, which impedes deployment predictability. Second, we describe how to minimize D&C latency of mission-critical tasks with a multi-graph dependency tracing and graph recomposition algorithm called CaDAnCE. Third, we empirically evaluate the effectiveness of CaDAnCE on a representative open DRE system case study based on NASA Earth Science Enterprise’s Magnetospheric Multi-Scale (MMS) mission system. Our results show that CaDAnCE avoids deployment order inversion while incurring negligible (order inversion while incurring negligible (
High resolution adaptive colour printing verification system for quality control of distorted elements
Authors: Artzai Picón Ruiz, Estibaliz Garrote Contreras, Jose Angel Gutierrez Olabarría, Evaristo Kahoraho Bukubille, José Ignacio Larrauri Villamor, Antton Azpiazu Kaltzakorta
Venue: Proceedings of the 4th WSEAS International Conference on Signal Processing, Computational Geometry & Artificial Vision (2004)

The growing quality needs, the importance of brand image and the market globalisation (texts printed in other languages (Cyrillic, Chinese, Arabic,...) make necessary total quality control specifically designed for printed elements. Quality Control and verification of planar geometry elements have been resolved using classic techniques of pattern matching, histograms, difference image and other algorithms. However, verification of elements which present minor deformations (plastics, clothes, metallic cans) produced by the nature of the material or by the printing method (rolls) is quite complex because the printing can be considered correct although it presents minor deformations while it maintains certain visual features, but they must be very sensitive to tiny spots or other defects. The objective of this article is to present a verification method for printed elements which allows the quality control in this sort of products.
Improved Wavelet-Based Embedded Image Coding Using a Dynamic Index Reordering Vector Quantizer
Authors: Jungwon Lee, Teahyung Lee, David V. Anderson
Venue: Proceedings of the Data Compression Conference (2008)

We present an improved wavelet-based embedded image coding scheme using vector quantization. The refinement process in wavelet-based embedded image coding is defined as a temporal domain, and dynamic index reordering is applied to the temporal domain of successive approximation vector quantization. In this method, the redundancy in consecutive angle or pattern transition is exploited. An efficient encoding and decoding algorithm is also presented to alleviate the computational complexity of the dynamic index reordering vector quantization. We investigate the index probability distribution of the compressed images using our proposed scheme and show PSNR performance improvement against the conventional successive approximation vector quantization.
A Quorum-Based Route Cache Maintenance Protocol for Mobile Ad-Hoc Networks
Authors: Gwo-Jong Yu
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications (2008)

The objective of this paper is to propose a quorum-based robust and efficient routing protocol (QRERP) for mobile Ad Hoc network. There are four phases in the proposed QRERP. They are initialization phase, route discovery phase, route reply phase and data transmission phases. In initialization phase, the entire network is partitioned into several connected subgraph. Each subgraph is represented by a host adjacency matrix (HAM) and a logical coterie tree. In the route discovery phase, a route can be discovered by local matrix computation, quorum-based routing table query or quorum-based flooding mechanism. When a route is established, a packet can be replied from destination to source node and the route information can be distributed to the set of coteries passed through by this routing path. Finally, after the routing path is confirmed by route reply packet, source node can communication with destination. During the data transmission, when route is broken due to node mobility or power exhausted, a route maintenance mechanism can be triggered to mainline the robustness of the routing path. The performance of the proposed QRERP is demonstrated by experimental results. From the results, we can conclude that the proposed approach has advantages of backup route, less control overhead, mobility maintenance and route maintenance.
Eye-gaze interaction for mobile phones
Authors: Heiko Drewes, Alexander De Luca, Albrecht Schmidt
Venue: Proceedings of the 4th international conference on mobile technology, applications, and systems and the 1st international symposium on Computer human interaction in mobile technology (2007)

In this paper, we discuss the use of eye-gaze tracking technology for mobile phones. In particular we investigate how gaze interaction can be used to control applications on handheld devices. In contrast to eye-tracking systems for desktop computers, mobile devices imply several problems like the intensity of light for outdoor use and calibration issues. Therefore, we compared two different approaches for controlling mobile phones with the eyes: standard eye-gaze interaction based on the dwell-time method and gaze gestures. Gaze gestures are a new concept, which we think has the potential to overcome many of these problems. We conducted a user study to see whether people are able to interact with applications using these approaches. The results confirm that eye-gaze interaction for mobile phones is attractive for the users and that the gaze gestures are an alternative method for eye-gaze based interaction.
Crossing numbers of graph embedding pairs on closed surfaces
Authors: Seiya Negami
Venue: Journal of Graph Theory (2001)

We shall prove that any two graphs G1 and G2 can be embedded together on a closed surface of genus g with at most 4g&thinsp;&middot;&thinsp;&beta;(G1)&thinsp;&middot;&thinsp;&beta;(G2) crossing points on their edges if they are embeddable on the surface, where &beta;(G) stands for the Betti number of G, and show several observations on crossings of graph embedding pairs. &copy; 2000 John Wiley & Sons, Inc. J Graph Theory 36: 8&ndash;23, 2001
Simulation of Primary Afferent Synapses in Unmyelinated Nerve Fiber
Authors: JunRan Zhang, JiaNan Wang, YiHui Liu, SanJue Hu
Venue: Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics - Volume 01 (2008)

The primary C-fiber afferent synapses is a glutamatergic synapse in the sensory pathway designed to transfer the chronic and dull pain information. Electrophysiological recordings from this synapse reveal some forms of facilitation and depression. To investigate the modulation mechanisms of synaptic transmission at primary C-fiber afferent synapse,we have developed a computational model which include pre- and post-synaptic components.The presynaptic component modified Hodgkin-Huxley equations to simulate the ionic and electrical events in a small unmyelinated nerve fiber terminal. Postsynaptic component include AMPA and NMDA receptors kinetics.The behaviour of the model is compared to experimental data and reproduce amplitude of synaptic depression during repetitive and bursting stimulation at different frequencies.The model shows steady-state depressions are frequencies related . Simulation of a single synaptic demonstrate the synapses depress during presynaptic stimulation due to depletion of presynaptic vesicles mainly.
New unconditionally stable numerical schemes for Maxwell's equations
Authors: Robert Horvath
Venue: International Journal of Computational Science and Engineering (2007)

In this paper, some new unconditionally stable numerical schemes are constructed for the solution of Maxwell's equations. We show how the new methods fit into the series of unconditionally stable methods that have been developed recently. We test the methods on a simple 2D numerical example.
Increasing the usefulness of additive spline models by knot removal
Authors: Harald Binder, Willi Sauerbrei
Venue: Computational Statistics Data Analysis (2008)

Modern techniques for fitting generalized additive models mostly rely on basis expansions of covariates using a large number of basis functions and penalized estimation of parameters. For example, a mixed model approach is used to fit a model for children's lung function that allows for non-linear influence of several covariates available in a substantial data set. While the resulting model is expected to have good prediction performance, its handling beyond simple visual presentation is problematic. It is shown how the number basis functions of the underlying B-spline representation can be reduced by knot removal techniques without refitting, while preserving the shape of the fitted functions. The condition for exact knot removal is extended towards approximate knot removal by incorporating the covariance matrix of the initial parameter estimates, resulting in considerable simplification of the model. Covariance matrices for the transformed parameter estimates are provided. It is demonstrated that enforcing the knot removal condition during estimation leads to the difference penalties employed in the P-spline approach for estimation of B-spline coefficients, and therefore provides a further justification for this type of penalty. A final transform to a truncated power basis provides a simple equation for the model. This increases transportability, while retaining properties of the initial fit such as good prediction performance.
Analysis on the Prospects of Parent-Adolescent Communication Served by Mobile Technology
Authors: Shenggang Yang, Qian Li, Xiaochen Wang, Yushun Li, Ronghuai Huang
Venue: Proceedings of the Fifth IEEE International Conference on Wireless, Mobile, and Ubiquitous Technology in Education (2008)

Parent-child’s relationships has attracted more and more attention reveals the lack of exploration of advanced technology in family education. Based on the collaborative project between Beijing Normal University and NOKIA, this article concerns about the prospects of providing services in family education by using mobile technology. This project is conducted by virtue of the combination of qualitative research methods and quantitative research methods. Survey results showed that mobile technology will do good to the parent-child’s relationship. Based on the results, the author will analyze the possibilities of providing services in parent-adolescent communication. The author also hopes that this study could expand the scope of using technology in education, especially set a good application in the domain of family education.
Insider-secure Signcryption KEM/Tag-KEM Schemes without Random Oracles
Authors: Chik How Tan
Venue: Proceedings of the 2008 Third International Conference on Availability, Reliability and Security (2008)

In this paper, we propose a signcryption key encapsulation (KEM) scheme and show that the proposed scheme is insider-secure against adaptive chosen ciphertext attack without random oracles and against strongly existential forgery without random oracles. In addition, by simple transformation of the proposed signcryption KEM scheme, we construct an insider-secure signcryption Tag-KEM scheme without random oracles, which responds to the calling from Yoshida and Fujiwara in 2007 on the construction of signcryption Tag-KEM scheme.