ppxscal/embedding_network huggingface dataset:
Performance Evaluation of an Anonymous Routing Protocol using Mobile Agents for Wireless Ad hoc Networks
Authors: Azzedine Boukerche, Yonglin Ren, Zhenxia Zhang
Venue: Proceedings of the 32nd IEEE Conference on Local Computer Networks (2007)

While much recent research focuses only on providing routing services for ad hoc networks, very little work has been done towards achieving anonymity for wireless ad hoc and sensor networks. However, malicious nodes in a wireless and mobile ad hoc environment can jeopardize the security of the network if the issues of secure data exchange are not properly handled. Encryption cannot fully protect the data communicated between nodes, as routing information may expose the identities of the communicating nodes and put their relationships at risk. In this paper, we propose an efficient anonymous routing protocol that uses a mobile agent paradigm for wireless and mobile ad hoc networks. In our protocol, only trustworthy nodes are allowed to participate in communications and the misbehavior of malicious nodes is thus prevented effectively. We describe our protocol and provide its performance evaluation based on simulation experiments implemented in an ns-2 simulator. Compared to the SDAR protocol, our experimental results demonstrate that our scheme not only achieves the necessary anonymity in mobile ad hoc networks, but also provides more security with reasonably little additional overhead.
Ring Blind Signature Scheme
Authors: Chengyu Hu, Daxing Li
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 01 (2007)

In this paper, we apply ring signature and blind signature concurrently and present a ring blind signature scheme which has the properties of ring signature and blind signature. We show how it plays an important role in some applications such as transferable e-cash with multiple banks.
A Review of Shape Descriptors for Document Analysis
Authors: O. R. Terrades, S. Tabbone, E. Valveny
Venue: Proceedings of the Ninth International Conference on Document Analysis and Recognition - Volume 01 (2007)

Shape descriptors play an important role in many doc- ument analysis application. In this paper we review some of the shape descriptors proposed in the last years from a new point of view. We propose the definitions of descriptor and primitive and introduce the notion of feature extraction method. With these definitions, we propose a new classifica- tion of shape descriptors that permits to classify according to their properties pointing out their strengths and weak- nesses.
Verification of Object Relational Maps
Authors: Krishna K. Mehra, Sriram K. Rajamani, A. Prasad Sistla, Sumit K. Jha
Venue: Proceedings of the Fifth IEEE International Conference on Software Engineering and Formal Methods (2007)

Enterprise software systems need to deal with two dominant data models. While object oriented languages (such as Java, C#, C++) are the dominant ways to write business logic, relational databases are the dominant ways to store data. Object-Relational (OR) maps are widely used to mediate between these two data models. We present a system to verify correctness of OR maps. We formulate simple correctness conditions for OR maps, and convert these conditions to validity of formulas in first order logic. We have built a verification tool called ROUNDTRIP that is able to both validate and find errors in OR maps defined in the ESQL language of the Microsoft EDM data model.
Long-term storage and management of encrypted biomedical data in real scenarios
Authors: I. Blanquer, V. Hernandez, D. Segrelles, E. Torres
Venue: Proceedings of the The International Conference on Emerging Security Information, Systems, and Technologies (2007)

This paper emphasizes the development and application of technologies to effective guarantying the confidentiality and integrity of patient data in Gridenabled biomedical applications. By strongly focusing on the interaction between security technologies and the human environment, this paper relates the experience of developing a model for the storage and management of encrypted medical data in the Grid. The ideas and concepts behind the proposed solution are briefly explained, as well as the components implementing the model in an OGSA compliant architecture. TRENCADIS, a project for managing DICOM Structured Reporting Objects for use in a Valencian Cyberinfrastructure for Medical Imaging in Oncology (CVIMO), is currently adopting the architecture as a core component.
An attempt to enhance conversation in CSCL text chat by displaying learners' typing process
Authors: W. Tsukahara, S. Akamatsu, K. Sakurada, X. Wang, H. Ito, T. Okamoto
Venue: Proceedings of the sixth conference on IASTED International Conference Web-Based Education - Volume 2 (2007)

To compensate the lack of awareness in CSCL environment, a CSCL chat tool capable of displaying all the participants' key typing process was developed. The system displays key by key typed in letters to other learners. The smooth turn-taking and topic negotiation is expected by the realization of real time display. From our preliminary evaluation, learners evaluated the conversation using this system easier, even though number of sentences between the proposed system and the usual chat system was not significantly different. Learners' comments after the usage shows that there are both merit and demerit of the system such as natural awareness and neglecting of writing complete sentences. In addition, tools such as showing dialog transition among participants/learners and typing speed calculation were developed for further analysis.
Automatic On-chip Memory Minimization for Data Reuse
Authors: Qiang Liu, George A. Constantinides, Konstantinos Masselos, Peter Y. K. Cheung
Venue: Proceedings of the 15th Annual IEEE Symposium on Field-Programmable Custom Computing Machines (2007)

FPGA-based computing engines have become a promising option for the implementation of computationally intensive applications due to high flexibility and parallelism. However, one of the main obstacles to overcome when trying to accelerate an application on an FPGA is the bottleneck in off-chip communication, typically to large memories. Often it is known at compile-time that the same data item is accessed many times, and as a result can be loaded once from large off-chip RAM onto scarce on-chip RAM, alleviating this bottleneck. This paper addresses how to automatically derive an address mapping that reduces the size of the required on-chip memory for a given memory access pattern. Experimental results demonstrate that, in practice, our approach reduces on-chip storage requirements to the minimum, corresponding to a reduction in on-chip memory size of up to 40× (average 10×) for some benchmarks compared to a naive approach. At the same time, no clock period penalty or increase in control logic area compared to this approach is observed for these benchmarks.
IP-based radio access network implementation cost vs. network security trade-off
Authors: Seyong Park, Alexandro Salvarani
Venue: Bell Labs Technical Journal (2007)

The primary motivation for the evolution from proprietary networks to Internet Protocol (IP)-based radio access network (RAN) systems is cost savings in terms of both capital expenditures (CAPEX) and operating expenditures (OPEX). This evolution, however, given the open network environment, introduces new security threats. Such threats can result in significant potential costs that need to be mitigated through additional investments in security solutions. Finding the optimal balance between investment and potential security risk is a complex endeavor. This paper presents rendezvous point (RP), a method to find the optimal point for a balanced security solution. &copy; 2007 Alcatel-Lucent.
2007 Special Issue: CODAM: A neural network model of consciousness
Authors: J. G. Taylor
Venue: Neural Networks (2007)

We present a review of the CODAM neural network control model of consciousness and develop it to arrive at a functional account of consciousness. The main feature is as a speed-up and error-correcting mechanism known, in engineering control theory, to be efficient in improving the speed of response and accuracy of any control system. We use the CODAM model to generate a set of predictions as to how such speed-up is achieved, as well as relate to previous explanations by CODAM of various attention-based phenomena.
An Ant Colony System Algorithm for the Multicast Routing Problem
Authors: Yuan Zhang, Huachun Cai, Ying Lin, Jing Xiao, Jun Zhang
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 04 (2007)

With the rapid development in network services, multicast has recently became a hot spot in communication technology. The multicast routing is the key to multicast implementation. A modified ant colony system is presented in this paper to do the single-origin-multi-destination routing without constraints. This algorithm first transforms the connective network into the corresponding distance complete graph, and then develops a Prim's-algorithm-like route construction process with an inclination factor towards the multicast vertexes. Simulations on a set of benchmark instances prove that the proposed algorithm is a worthy attempt for the multicast routing problem.
Study on Modular Design-based Reconfigurable Embedded Network Numerical Control
Authors: J. H. Zhang, Z. D. Zhou
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 01 (2007)

The modular design-based reconfigurable embedded numerical control system is composed of a series of embedded control modules, which are designed according to universal not special object or condition. However, choosing some appropriate modules can construct a special numerical control system. The framework of the modular design-based reconfigurable embedded numerical control system is presented in the paper. Detailed information about functional modules is also given. The key points in design are resource sharing, scheduling and data traffic. Also, the realizing technologies of embedded real-time operating system customization, embedded web server, communication between modules and resource scheduling are discussed. The system has high extensibility, reliability, applicability and reconfiguration. It also has high arithmetic capability and low cost.
Intensive Use of Bayesian Belief Networks for the Unified, Flexible and Adaptable Analysis of Misuses and Anomalies in Network Intrusion Detection and Prevention Systems
Authors: Pablo Garcia Bringas
Venue: Proceedings of the 18th International Conference on Database and Expert Systems Applications (2007)

This paper describes the ESIDE-Depian Intrusion Detection and Prevention System, which uses Bayesian structural and parametric learning and also evidence propagation and adaptation, in order to improve the accuracy and manageability of Network Intrusion Detection Systems (NIDS). Current NIDS do not consider the two main detection paradigms, i.e. Misuse Detection and Anomaly Detection, in an unified style, so the analysis is not inherently complete. Besides, historical data are not generally used, neither for analysis nor for sequential adaptation of the knowledge representation models used for detection; hence this wealthy information about the essence and the potential trends of the target system is not commonly considered. Thus, by the generalized use of Bayesian Belief Networks, ESIDE-Depian achieves the main goal of detecting and preventing both well-known and also zero-day attacks with excellent results, by means of unified real-time analysis of network traffic.
Implicit 3D modeling and tracking for anywhere augmentation
Authors: Sehwan Kim, Stephen DiVerdi, Jae Sik Chang, Taehyuk Kang, Ronald Iltis, Tobias Höllerer
Venue: Proceedings of the 2007 ACM symposium on Virtual reality software and technology (2007)

This paper presents an online 3D modeling and tracking methodology that uses aerial photographs for mobile augmented reality. Instead of relying on models which are created in advance, the system generates a 3D model for a real building on the fly by combining frontal and aerial views with the help of an optical sensor, an inertial sensor, a GPS unit and a few mouse clicks. A user's initial pose is estimated using an aerial photograph, which is retrieved from a database according to the user's GPS coordinates, and an inertial sensor which measures pitch. To track the user's position and orientation in real-time, feature-based tracking is carried out based on salient points on the edges and the sides of a building the user is keeping in view. We implemented camera pose estimators using both a least squares and an unscented Kalman filter (UKF) approach. The UKF approach results in more stable and reliable vision-based tracking. We evaluate the speed and accuracy of both approaches, and we demonstrate the usefulness of our computations as important building blocks for an Anywhere Augmentation scenario.
Note: Linear relations for p-harmonic functions
Authors: Hisayasu Kurata
Venue: Discrete Applied Mathematics (2008)

We discuss the p-harmonicity of the linear combination of p-harmonic functions in the Euclidean space and on a tree. If p
Application of Particle Swarm Optimization Algorithm to Reservoir Operation
Authors: Qiang Huang, Hong-bo Zhang, Xiao-nan Chen, Yu-jie Lv
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 05 (2007)

Difficulties likely exist in optimal reservoir operation along with discreteness and nonlinear constraints. The purpose of this paper is to aim at overcoming these defects. The particle swarm optimization algorithm with optimizing ability in the continuous field is suggested for reservoirs optimal operation to solve the bottleneck in the optimizing process caused by discreteness. Moreover, in order to tackle the nonlinear constraint problem, this article use annealing penalty function and chaos variation operator to efficiently improve the shortcomings on reservoir optimal operation. The results show that the particle swarm optimization algorithm is applicable to optimal reservoir operation.
Shape-Based Alphabet for Off-line Arabic Handwriting Recognition
Authors: F. Menasri, N. Vincent, M. Cheriet, E. Augustin
Venue: Proceedings of the Ninth International Conference on Document Analysis and Recognition - Volume 02 (2007)

This article describes an off-line handwritten Arabic words recognition system. Both explicit grapheme segmen- tation and feature extraction are originally designed for Latin cursive handwriting. The recognizer itself is a Hybrid HMM/NN. We introduce a new shape-based alphabet for handwriting Arabic recognition which is intended to benefit from some specificities of Arabic writing. We performed several experiments using IFN/ENIT benchmark database to validate our approach. Our rec- ognizer performs as close as the state of the art recogni- tion rate with 87%. The latter results are indeed very en- couraging as many perspectives and improvements may be considered. Especially, the explicit processing of dots and diacritics, therefore making use of more prior knowledge of Arabic writing specificities.
Interactive 3D ScanningWithout Tracking
Authors: Matthew J. Leotta, Austin Vandergon, Gabriel Taubin
Venue: Proceedings of the XX Brazilian Symposium on Computer Graphics and Image Processing (2007)

Using inexpensive and readily available materials--a calibrated pair of cameras and a laser line projector--a 3D laser range scanner which requires no tracking is implemented in this paper. We introduce a planarity constraint for reconstruction, based on the fact that all points observed on a laser line in an image are on the same plane of laser light in 3D. This plane of laser light linearly parametrizes the homography between a pair of images of the same laser line, and this homography can be recovered from point correspondences derived from epipolar geometry. Points visible from multiple views can be reconstructed via triangulation and projected onto this plane, while points visible in only one view can be recovered via ray-plane intersection. The use of the planarity constraint during reconstruction increases the system's accuracy, and using the planes for reconstruction increases the number of points recovered. Additionally, an interactive scanning environment is constructed, where incremental reconstruction is used to provide continuous visual feedback. Reconstructions with this method are shown to have higher accuracy than standard triangulation.
Indexable PLA for efficient similarity search
Authors: Qiuxia Chen, Lei Chen, Xiang Lian, Yunhao Liu, Jeffrey Xu Yu
Venue: Proceedings of the 33rd international conference on Very large data bases (2007)

Similarity-based search over time-series databases has been a hot research topic for a long history, which is widely used in many applications, including multimedia retrieval, data mining, web search and retrieval, and so on. However, due to high dimensionality (i.e. length) of the time series, the similarity search over directly indexed time series usually encounters a serious problem, known as the "dimensionality curse". Thus, many dimensionality reduction techniques are proposed to break such curse by reducing the dimensionality of time series. Among all the proposed methods, only Piecewise Linear Approximation (PLA) does not have indexing mechanisms to support similarity queries, which prevents it from efficiently searching over very large time-series databases. Our initial studies on the effectiveness of different reduction methods, however, show that PLA performs no worse than others. Motivated by this, in this paper, we re-investigate PLA for approximating and indexing time series. Specifically, we propose a novel distance function in the reduced PLA-space, and prove that this function indeed results in a lower bound of the Euclidean distance between the original time series, which can lead to no false dismissals during the similarity search. As a second step, we develop an effective approach to index these lower bounds to improve the search efficiency. Our extensive experiments over a wide spectrum of real and synthetic data sets have demonstrated the efficiency and effectiveness of PLA together with the newly proposed lower bound distance, in terms of both pruning power and wall clock time, compared with two state-of-the-art reduction methods, Adaptive Piecewise Constant Approximation (APCA) and Chebyshev Polynomials (CP).
Convergence with a fixed regulator in lattice ordered groups and applications to MV-algebras
Authors: &#x0160;tefan &#x010c;ern&#x00e1;k
Venue: Soft Computing - A Fusion of Foundations, Methodologies and Applications (2007)

A convergence with a fixed regulator v in lattice ordered groups is applied to MV-algebras. For each Archimedean MV-algebra A there exists a v-Cauchy completion A * and it is uniquely determined up to isomorphisms over A. The relation between the Dedekind completion A &#x2227; of A and A * is established. There is solved a question of the existence of the greatest v-Cauchy complete ideal of A.
10,000 Microcomputers for French Secondary Schools
Authors: J. Hebenstreit
Venue: Computer (1980)

Few projects compare in scope to France's first CAI experiment. An even more ambitious plan, now in its initial stages, will be implemented by 1985.
System design extreme makeover
Authors: D. D. Gajski
Venue: Proceedings of the 2nd ACM/IEEE International Conference on Formal Methods and Models for Co-Design (2005)

With complexities of systems-on-chip (SOCs) rising almost daily, the design community has been searching for a new methodology that can handle given complexities with increased productivity and decreased time-to-market. In order to find a solution for the system-level design flow, we must look at the system gap between SW and HW designs and then try to bridge this gap by developing a design flow that is based on common principles applicable to software and hardware. In order to achieve this design flow we can define design process by using the concepts found in standard algebras which, in turn, allows us to define design models more formally with clean unambiguous semantics. Such clean semantics allows automatic model generation, simplifies synthesis algorithms and verification techniques.
A Decision Model for Closed Queuing Networks
Authors: K. S. Trivedi
Venue: IEEE Transactions on Software Engineering (1979)

This paper considers a computer configuration design problem. The computer system is modeled by a closed queuing network. The system throughput is the objective function to be maximized and the speed of the devices are the decision variables. A rich class of non-linear cost functions is considered.
Increasing Detection Rate of User-to-Root Attacks Using Genetic Algorithms
Authors: Zorana Bankovic, Slobodan Bojanic, Octavio Nieto-Taladriz, Atta Badii
Venue: Proceedings of the The International Conference on Emerging Security Information, Systems, and Technologies (2007)

An extensive set of machine learning and pattern classification techniques trained and tested on KDD dataset failed in detecting most of the user-to-root attacks. This paper aims to provide an approach for mitigating negative aspects of the mentioned dataset, which led to low detection rates. Genetic algorithm is employed to implement rules for detecting various types of attacks. Rules are formed of the features of the dataset identified as the most important ones for each attack type. In this way we introduce high level of generality and thus achieve high detection rates, but also gain high reduction of the system training time. Thenceforth we re-check the decision of the user-toroot rules with the rules that detect other types of attacks. In this way we decrease the false-positive rate. The model was verified on KDD99, demonstrating higher detection rates than those reported by the stateof- the-art while maintaining low false-positive rate.
SVD based initialization: A head start for nonnegative matrix factorization
Authors: C. Boutsidis, E. Gallopoulos
Venue: Pattern Recognition (2008)

We describe Nonnegative Double Singular Value Decomposition (NNDSVD), a new method designed to enhance the initialization stage of nonnegative matrix factorization (NMF). NNDSVD can readily be combined with existing NMF algorithms. The basic algorithm contains no randomization and is based on two SVD processes, one approximating the data matrix, the other approximating positive sections of the resulting partial SVD factors utilizing an algebraic property of unit rank matrices. Simple practical variants for NMF with dense factors are described. NNDSVD is also well suited to initialize NMF algorithms with sparse factors. Many numerical examples suggest that NNDSVD leads to rapid reduction of the approximation error of many NMF algorithms.
A Software Technique to Improve Yield of Processor Chips in Presence of Ultra-Leaky SRAM Cells Caused by Process Variation
Authors: Maziar Goudarzi, Tohru Ishihara, Hiroto Yasuura
Venue: Proceedings of the 2007 Asia and South Pacific Design Automation Conference (2007)

Exceptionally leaky transistors are increasingly more frequent in nano-scale technologies due to lower threshold voltage and its increased variation. Such leaky transistors may even change position with changes in the operating voltage and temperature, and hence, redundancy at circuit-level is not sufficient to tolerate such threats to yield. We show that in SRAM cells this leakage depends on the cell value and propose a first software-based runtime technique that suppresses such abnormal leakages by storing safe values in the corresponding cache lines before going to standby mode. Analysis shows the performance penalty is, in the worst case, linearly dependent to the number of so-cured cache lines while the energy saving linearly increases by the time spent in standby mode. Analysis and experimental results on commercial processors confirm that the technique is viable if the standby duration is more than a small fraction of a second.