ppxscal/embedding_network huggingface dataset:
IEEE 802.11 network behaviour in the presence of Bluetooth network
Authors: Bartlomiej Zielinski
Venue: Proceedings of the Second International Conference on Systems and Networks Communications (2007)

IEEE 802.11 and Bluetooth are the most popular wireless transmission interfaces. As they operate in the same unlicensed frequency band, despite spread spectrum techniques, some interferences may occur. This paper presents the results collected in an experimental, wireless network containing elements of both standards. They show how active Bluetooth piconet degrades usable parameters of IEEE 802.11 network.
Case studies for self-directed learning environment using lecture archives
Authors: Shinobu Hasegawa, Youichi Tajima, Masato Matou, Masatomo Futatsudera, Toshiya Ando
Venue: Proceedings of the sixth conference on IASTED International Conference Web-Based Education - Volume 2 (2007)

The main topic addressed in this paper is to support graduate students of diverse backgrounds to take basic courses, before joining a research group to specialize in a particular field. In order to realize effective graduate education, we have developed two types of lecture archives system which systematically store actual lectures in School of Information Science and deliver them as complementary learning materials on the campus network. This paper describes overview of the lecture archives systems in 2005 and 2006, and reports on the case studies of the lecture archives systems. The results of students' questionnaires indicate those effectiveness and some future tasks.
Face Recognition Method Combining 3D Face Model with 2D Recognition
Authors: Minghua Zhao, Zhisheng You, Yonggang Zhao, Zhifang Liu
Venue: Proceedings of the Fourth International Conference on Image and Graphics (2007)

A new algorithm that combines 3D face model construction with 2D recognition is proposed. 3D face models are projected to different directions and a series of 2D face images are obtained. The projected 2D results are used as templates to match the input face images with different poses. The method that constructs 3D face model with 2.5D scans acquired by Minolta vivid 910 is studied and a 3D face database containing 10 persons is built. Experimental results show that the proposed algorithm is faster than 3D morphable model method and is more efficient than the method that uses just frontal images as templates while dealing with face images with pose variations.
A Novel Off-line Signature Verification Based on One-class-one-network
Authors: Jingbo Zhang, Xiaoyun Zeng, Yinghua Lu, Lei Zhang, Meng Li
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 02 (2007)

This paper proposes a novel off-line signature verification method based on one-class-one-network classification, using four groups features. The features include direction features, texture features, dynamic features and complexity index. At last, one-class-one-network classifier is used to verify the signatures. The signature verification system was experimented on real data sets and the results show the system is effective with the average error rate can reach 1.8%, which is obviously satisfactory.
Evaluating asynchronous and synchronous distance learning platform in a high school
Authors: S. Manitsaris, S. Pavlidis, E. Bompoli
Venue: Proceedings of the sixth conference on IASTED International Conference Web-Based Education - Volume 2 (2007)

ICT can play significant role in the educational process as they bring important changes to the traditional way of teaching, using multimedia and internet technology. This paper presents the evaluation of the application of a Learning Management System, called ASDL (Asynchronous & Synchronous Distance Learning), in Greek private high-schools. ASDL was mainly implemented to be used by students. Pupils are called to use and evaluate such a system for their first time. Studying the questionnaires helped us to export useful conclusions about the pupil's available material infrastructure at home and the way they appreciated the system. Pupils were between 12 and 15 years old. The questionnaires have been integrated in an explicative "story" due to the particular age of the pupils. This method was a better way, in comparison to the traditional questionnaires, to express more clear and comprehensible questions and to get safer answers. It is concluded, through the data analysis and our experience that the participation in this project and the use of ASDL really appreciated and helped pupils. Nevertheless, approximately four out of five pupils could systematically meet asynchronous communication requirements and less than one out of three could participate to synchronous distance learning.
Universal System Diagnosis Algorithms
Authors: J. E. Smith
Venue: IEEE Transactions on Computers (1979)

A class of simple digital system diagnosis algorithms is presented, and two members of the class are examined in detail. The algorithms are based on the assumption that good units can be replaced during the diagnosis process. Information pertaining to the system testing structure is not used by the two principal algorithms, so they can be applied regardless of system structure. The efficiency of the algorithms in terms of good units replaced is analyzed, and they are shown to compare favorably with methods for special case systems that have been proposed by others.
Adaptive Blind Watermarking Based on Improved Noise Sensitivity
Authors: Shengjun Xue, Xuan Teng
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 04 (2007)

By improving existing technology used in noise sensitivity, a novel adaptive blind watermarking algorithm is proposed. The embedding procedure operates adaptively in the domain of intermediate coefficients, according to the noise sensitivity. Robustness of it on selected attacks like Gaussian noise, median filtering, JPEG compression and cropping is tested. In addition, the perceptual transparency has been improved as well. Furthermore, the watermark can be detected without the original image.
An Improved Ant-based Classifier for Intrusion Detection
Authors: Junbing He, Dongyang Long, Chuan Chen
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 04 (2007)

Ant based classifier has been proposed to extract classification rules that can predict the class label of an unlabeled instance, but in the field of intrusion detection it is relatively unexplored. In this paper we describe a variety of modifications that we have made to the data mining algorithms in order to improve accuracy and efficiency. We also implement the modified algorithm on intrusion detection. The ant colony algorithm is employed to derive a set of classification rules from network audit data. Experiment result and comparative study shows our approach is effective and practical.
Designing a Parallel GA for Large Instances of the Workforce Planning Problem
Authors: E. Alba, G. Luque
Venue: Proceedings of the Seventh International Conference on Intelligent Systems Design and Applications (2007)

Workforce planning is an important activity that enables organizations to determine the workforce needed for a given task. Solving a workforce planning problem is a hard com- binatorial process requiring modern techniques such ad- vanced metaheuristics. In this work, we analyze several op- tions to design a parallel genetic algorithm, which can find high-quality solutions to realistic size problem instances.
Computation of the Transition Matrix of a Linear Sequential Circuit
Authors: M. B. Scherba
Venue: IEEE Transactions on Computers (1973)

The general response of a linear sequential circuit involves a transition matrix in the form of a matrix A raised to a variable power. The power becomes arbitrarily high causing the direct computation of the transition matrix to become very cumbersome. This correspondence demonstrates that A, having finite-field elements, may be transformed into a matrix of real numbers. Known methods may then be applied to this real matrix to simplify computing a power of it. The result is then transformed back to the finite field which is the desired result However, numerical difficulties as mentioned in the conclusion prevent this method from being the final solution to the problem.
Development of a Database for Integrated Missile System Design in Web Services-based MDO Framework
Authors: Jeong-Oog Lee, Seungjin Lee, Ho-Jun Lee, Jae-Woo Lee
Venue: Proceedings of the The 2007 International Conference Computational Science and its Applications (2007)

In this study, a database has been developed for integrated missile system design. The framework is based on Web services and Globus Toolkit. Various Analysis tools, optimization tools, database, and CAD are integrated into the missile MDO framework. The DB has been designed in a way where all the design related data can be shared among various analysis tools and optimization tools so that the required information can be transferred quickly.
An Inheritance Procedure for a Knowledge Representation Scheme Based on Fuzzy Petri Nets
Authors: Slobodan Ribaric, Nikola Pavesic
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 01 (2007)

Knowledge about facts from the real world is very often uncertain, ambiguous and vague. As a result, the inference mechanism based on such facts generates uncertain and vague conclusions. In this paper we describe a formal model of knowledge representation for uncertain and vague domains. The model is based on the theory of high-level fuzzy Petri Nets (FPNs), and a fuzzy inheritance procedure that uses the dynamical properties of a FPN is proposed. The upper-time complexity of the proposed inheritance algorithm is O(nm), where n is the number of places (concepts) and m is the number of transitions (relations) in the scheme. An illustrative example of the inheritance procedure is presented.
Adaptive fastest path computation on a road network: a traffic mining approach
Authors: Hector Gonzalez, Jiawei Han, Xiaolei Li, Margaret Myslinska, John Paul Sondag
Venue: Proceedings of the 33rd international conference on Very large data bases (2007)

Efficient fastest path computation in the presence of varying speed conditions on a large scale road network is an essential problem in modern navigation systems. Factors affecting road speed, such as weather, time of day, and vehicle type, need to be considered in order to select fast routes that match current driving conditions. Most existing systems compute fastest paths based on road Euclidean distance and a small set of predefined road speeds. However, "History is often the best teacher". Historical traffic data or driving patterns are often more useful than the simple Euclidean distance-based computation because people must have good reasons to choose these routes, e.g., they may want to avoid those that pass through high crime areas at night or that likely encounter accidents, road construction, or traffic jams. In this paper, we present an adaptive fastest path algorithm capable of efficiently accounting for important driving and speed patterns mined from a large set of traffic data. The algorithm is based on the following observations: (1) The hierarchy of roads can be used to partition the road network into areas, and different path pre-computation strategies can be used at the area level, (2) we can limit our route search strategy to edges and path segments that are actually frequently traveled in the data, and (3) drivers usually traverse the road network through the largest roads available given the distance of the trip, except if there are small roads with a significant speed advantage over the large ones. Through an extensive experimental evaluation on real road networks we show that our algorithm provides desirable (short and well-supported) routes, and that it is significantly faster than competing methods.
Functional design of games to support natural resource management policy development
Authors: Pieter Bots, Els Van Daalen
Venue: Simulation and Gaming (2007)

This article works toward a conceptual framework for designing games to support policy development for managing natural resources. The point of departure for this framework is a typology for functions of games in support of policy. This typology consists of six classes of functions of a policy game: research and analyze policy contexts as systems, design and recommend alternative solutions to a policy problem, provide advice to a client on what strategy to follow in the policy process, mediate between di ferent stakeholders, democratize policy development by actively bringing in stakeholder views, and clarify the values and arguments pertinent to the policy discourse. These functions are illustrated using specific examples of games that have been used in the domain of natural resource management (NRM). The framework discussed in this article may help game designers to match specific game properties (players, roles, rewards, and representations of the NRM context) with the intended function of the game in the policy-development process.
Face Oriented Discrimination Gabor Features
Authors: Fan Ou, Chong Liu, Xusheng Tang, Zongying Ou
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 02 (2007)

Gabor face representation has been getting popular in face recognition applications; however, it also suffers from the high dimensional data containing diverse redundancy and different random noise. This paper deals with analysis and selection of discriminating features in face recognition. First the feature differences between every two face images within a training data set are calculated and grouped into two categories: intra individual set and extra individual set. Then the rank of discriminating capabilities and redundancy between features can be estimated by analyzing the distributions of feature differences in intra set and extra set based on statistics and mutual information theory .First, an approach for ranking the discriminating abilities of Gabor features singly by mutual information analysis is proposed. In view of the widths of the Gabor filter convolutions at adjacent nodes exist considerable overlap, a simply sequential elimination redundancy approach based on joint mutual information is also proposed in this paper. The rank and the optimal feature combination selection with the proposed approach had been implemented on the training set of the CAS-PEAL-R1 database, and some testing experiments were implemented on probe sets of the CAS-PEAL-R1 database and FERET face database. The experiment results show that taking only about half features with top discriminating rank can achieve nearly the same recognition performance as taking full set features. A more sophisticated approach based on combining the rank information and elimination of redundancy by analysis joint of conditional mutual information can get even better performance yet only using one fifth of the full features.
Teaching and learning in live online classrooms
Authors: Mihaela Sabin, Bryan Higgs
Venue: Proceedings of the 8th ACM SIGITE conference on Information technology education (2007)

Online presence of information and services is pervasive. Teaching and learning are no exception. Courseware management systems play an important role in enhancing instructional delivery for either traditional day, full-time students or non-traditional evening, party-time adult learners enrolled in online programs. While online course management tools are with no doubt practical, they limit, however, live or synchronous communication to "chat" rooms, whose discourse has little in common with face-to-face class communication. A more recent trend in online teaching and learning is the adoption and integration of web conferencing tools to enable live online classrooms and recreate the ethos of traditional face-to-face sessions. In this paper we present the experience we have had with the adoption of the LearnLinc® web conferencing tool, an iLinc Communications, Inc. product. We have coupled LearnLinc with Blackboard®, for the online and hybrid computer science courses we offered in the past academic year in the evening undergraduate and graduate computer science programs at Rivier College. Twelve courses, enrolling over 150 students, have used the synchronous online teaching capabilities of LearnLinc. Students who took courses in the online or hybrid format could experience a comparable level of interaction, participation, and collaboration as in traditional classes. We solicited student feedback by administering a student survey to over 100 students. The 55% response rate produced the data for this paper's study. We report on the study's findings and show students' rankings of evaluation criteria applied to hybrid and online instructional formats, with or without a web conferencing tool. Our analysis shows that students ranked favorably LearnLinc live sessions added to Blackboard-only online classes. In addition, how they learned in live online classrooms was found to be the closest to the hybrid class experience with regard to teaching practices they perceived as most important to them, such as seeking instructor's assistance, managing time on task, and exercising problem solving skills.
Transition Fault Simulation
Authors: John Waicukauski, Eric Lindbloom, Barry Rosen, Vijay Iyengar
Venue: IEEE Design Test (1987)

Delay fault testing is becoming more important as VLSI chips become more complex. Components that are fragments of functions,such as those in gate-array designs, need a general model of a delay fault and a feasible method of generating test patternsand simulating the fault. The authors present such a model, called a transition fault, which when used with parallel-pattern,single-fault propagation, is an efficient way to simulate delay faults. The authors describe results from 10 benchmark designsand discuss add-ons to a stuck fault simulator to enable transition fault simulation. Their experiments show that delay faultsimulation can be done of random patterns in less than 10% more time than needed for a stuck fault simulation.
Ant-Based Stable Multipath Routing Algorithm in Mobile Ad Hoc Networks
Authors: Zhengyu Wu, Xiangjun Dong, Lin Cui
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 04 (2007)

A Mobile Ad hoc Network (MANET) is one consisting of a set of mobile hosts capable of communicating with each other without the assistance of base stations. Earlier research has proposed several unipath routing protocols specifically on MANET, but most studies have not focused on the limitations of battery resource. However, the single path is easily broken and needs to perform a route discovery process again due to the dynamic topology of ad hoc networks. To alleviate these problems, a new routing algorithm called Ant-Based Stable Multipath Routing Algorithm (ABSMRA) is proposed. ABSMRA is based on swarm intelligence and especially on the ant colony based meta heuristic. The proposed algorithm can consider link stability and provide the most stable path to route according to probability. The introduced routing algorithm is highly adaptive, efficient and scalable. Simulation results indicate that ABSMRA has a higher packet delivery ratio, lower end-to-end delay and lower routing load than AODV.
Visual Selection and Shifting Mechanisms Based on a Network of Chaotic Wilson-Cowan Oscillators
Authors: Liang Zhao, Fabricio A. Breve, Marcos G. Quiles, Roseli A. F. Romero
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 05 (2007)

In this paper, a Visual Selection and a Shifting Mecha- nisms based on a lattice of coupled chaotic Wilson-Cowan oscillators is proposed. The oscillators representing each object in a given visual scene are synchronized to produce a chaotic trajectory. A cooperation and competition mechanisms are also introduced to accelerate oscillating frequency of the salient object as well as to slow down other objects in the same scene. The model can not only discriminate each object among others in a given visual scene, but also deliver the focus of attention to a salient object in an instant of time. In comparison to other visual selection approaches, this model presents at least three new features. First, it is able to highlight objects in complex forms, including those that are non-linear separable. Second, a shifting mechanism used to change the focus of attention among the objects. Lastly, oscillators representing the salient object will jump from chaotic phase to periodic phase. This behavior matches well to biological experiments on pattern recognition of rabbit. Computer simulations are performed and the results show that the proposed model is promising as a Selection Mechanism with Shifting embedded in a Visual Attention System.
A Parallel Structure for Signed-Number Multiplication and Addition
Authors: R. De Mori
Venue: IEEE Transactions on Computers (1972)

An algorithm for performing signed-number multiplications using positive-number full multipliers is presented. It leads to very simple input-and output-correcting networks which are cellular iterative and introduce negligible additional delay.
Memsherlock: an automated debugger for unknown memory corruption vulnerabilities
Authors: Emre C. Sezer, Peng Ning, Chongkyung Kil, Jun Xu
Venue: Proceedings of the 14th ACM conference on Computer and communications security (2007)

Software vulnerabilities have been the main contributing factor to the Internet security problems such as fast spreading worms. Among these software vulnerabilities, memory corruption vulnerabilities such as buffer overflow and format string bugs have been the most common ones exploited by network-based attacks. Many security countermeasures (e.g., patching, automatic signature generation for intrusion detection systems) require vulnerability information to function correctly. However, despite many years of research, automatically identifying unknown software vulnerabilities still remains an open problem. In this paper, we present the development of a security debugging tool named MemSherlock, which can automatically identify unknown memory corruption vulnerabilities upon the detection of malicious payloads that exploit such vulnerabilities. MemSherlock provides critical information for unknown memory corruption vulnerabilities, including (1) the corruption point in the source code (i.e., the statement that allows the exploitation of memory corruption vulnerability), (2) the slice of source code that helps the malicious input to reach the corruption point, and (3) the description of how the malicious input exploits the unknown vulnerability. We evaluate MemSherlock with a set of 11 real-world applications that have buffer overflow, heap overflow, and format string vulnerabilities. The evaluation results indicate that MemSherlock is a useful tool to facilitate the automatic vulnerability analysis process.
Towards leveraging model transformation to support model-based testing
Authors: Leila Naslavsky, Hadar Ziv, Debra J. Richardson
Venue: Proceedings of the twenty-second IEEE/ACM international conference on Automated software engineering (2007)

The adoption of model-driven development is leading to increased use of models in conjunction with source code in software testing. Model-based testing, however, introduces new challenges for testing activities, which include creation and maintenance of traceability information among test-related artifacts. Traceability is required to support activities such as model-based result evaluation, regression testing and coverage analysis. In this paper, we present an automated approach that leverages model transformation techniques to support test generation. The test generation process includes creation of test-related models and fine-grained relationships among these models. We also motivate our approach with a simple example demonstrating support for model-based regression testing