ppxscal/embedding_network huggingface dataset:
A New Qos Control Scheme Using Dynamic Window Size Control for Wide Area Wireless Networks
Authors: Fusao Nuno, Yoshitaka Shimizu, Kazuji Watanabe
Venue: Proceedings of the Second International Conference on Systems and Networks Communications (2007)

In the wide area wireless network, most wireless terminals will send small amounts of data with very long transmission intervals. Therefore, each access point must accommodate a large number of wireless terminal and devices. Moreover, the network is required to accommodate a variety of wireless terminals, so quality of service (QoS) needs to be guaranteed. In this paper, we propose a new QoS control scheme for the wide area wireless network. The proposed scheme observes the delay time of the higher priority class and, according to the delay, it amends the back-off parameters of the lower priority class. This guarantees the throughput and delay performance of the higher priority class. This paper also clarifies the problems of the conventional scheme and reveals the throughput and delay performance of the conventional and proposed scheme by computer simulation.
Validation, Verification, and Testing for the Individual Programmer
Authors: M. A. Branstad
Venue: Computer (1980)

Good programming demands sound testing, verification, and validation techniques throughout the life cycle-even if the development environment has limited support and resources.
Particle Detection on Election Microscopy Micrographs Using Multi-Classifier Systems
Authors: Lucas M. Oliveira, Raul B. Paradeda, Bruno M. Carvalho, Anne M. P. Canuto, Marcilio C. P. de Souto
Venue: Proceedings of the 7th International Conference on Hybrid Intelligent Systems (2007)

The determination of the three-dimensional (3D) structure of biological macromolecules at different configurations can be very important for understanding biological processes at the molecular level. The detection of individual particles from electron microscopy (EM) micrographs turns into a major labor-intensive bottleneck, when the number of particles needed starts to exceed a few tens of thousand molecular images. Multi-classifier systems have been widely investigated as tools for performing complex classifying tasks. In this work, we investigate the adequacy of using multi-classifier systems to detect particles on electron microscopy micrographs. In order to do so, we compare the performance of five algorithms for generating individual classifiers and three other ones for multi-classifier algorithms. Such results are also compared with others found in the literature. In terms of results, the multi-classifier systems generated show larger accuracy (correct classification) and lower false positive and negative rates.
Evaluating Software Development by Analysis of Changes: Some Data from the Software Engineering Laboratory
Authors: D. M. Weiss
Venue: IEEE Transactions on Software Engineering (1985)

An effective data collection methodology for evaluating software development methodologies was applied to five different software development projects. Results and data from three of the projects are presented. Goals of the data collection included characterizing changes, errors, projects, and programmers, identifying effective error detection and correction techniques, and investigating ripple effects.
An Implementation of Multi-Modal Game Interface Based on PDAs
Authors: Kue-Bum Lee, Jung-Hyun Kim, Kwang-Seok Hong
Venue: Proceedings of the 5th ACIS International Conference on Software Engineering Research, Management & Applications (2007)

In computer animation and interactive computer games, gesture and speech modality can be a powerful interface between humans and computers. In this paper, we propose a Personal Digital Assistant (PDA)- based multi-modal network game interface using speech, gesture and touch sensations. To verify the validity of our approach, we implement a multi-modal omok game using TCP/IP on a PDA network. The experimental results using the proposed multi-modal network game resulted in an average recognition rate of 97.4%, and accordingly as the weaknesses of unimodality, such as incorrect command processing by recognition error, are offset by the strengths of other modalities, the user can enjoy a more interactive mobile game interface in any given environment.
An European project "virtual performance centred environment for training in nanoelectronics"
Authors: Slavka Tzanova, Philippe Morey-Chaisemartin, Christian Schaeffer, Malenko Tzanov
Venue: Proceedings of the sixth conference on IASTED International Conference Web-Based Education - Volume 2 (2007)

In this paper an international project on development of a Web-based performance support system with educational elements in nanoelectronics is presented. It is a two-year project within the European program Leonardo da Vinci and the partners are from small and medium enterprises in micro- and nanoelectronics, training organizations, universities and social partners from four European countries - France, Bulgaria, the Netherlands and Germany. The project is aimed at implementation of innovative approaches for performance-centred learning and development of new instruments in instructional design of task-performance-centred courses for education in nanoelectronics.
Toponym Recognition in Scanned Color Topographic Maps
Authors: J. Pouderoux, J.-C. Gonzato, A. Pereira, P. Guitton
Venue: Proceedings of the Ninth International Conference on Document Analysis and Recognition - Volume 01 (2007)

Topographic paper maps are a common support for ge- ographical information. In the field of document analysis of this kind of support, this paper proposes an automatic approach to extract and recognize toponyms. We present a technique based on image segmentation and connected component processing. Different filtering stages ensure the consistency of plausible characters and strings. Detected text areas are used to feed an OCR software and the recog- nized words are analyzed and corrected. The main advan- tage of our technique is that no assumption is made about the character font, size or orientation. Experimental results obtained are encouraging in term of recognition efficiency.
Testing for Perturbations of Program Statements
Authors: S. J. Zeil
Venue: IEEE Transactions on Software Engineering (1983)

Many testing methods require the selection of a set of paths on which tests are to be conducted. Errors in arithmetic expressions within program statements can be represented as perturbing functions added to the correct expression. It is then possible to derive the set of errors in a chosen functional class which cannot possibly be detected using a given test path. For example, test paths which pass through an assignment statement "X := f(Y)" are incapable of revealing if the expression "X -f( Y)" has been added to later statements. In general, there are an infinite number of such undetectable error perturbations for any test path. However, when the chosen functional class of error expressions is a vector space, a finite characterization of all undetectable expressions can be found for one test path, or for combined testing along several paths. An analysis of the undetected perturbations for sequential programs operating on integers and real numbers is presented which permits the detection of multinomial error terms. The reduction of the space of (potential undetected errors is proposed as a criterion for test path selection.
The heart muscle&rsquo;s putative &lsquo;secondary structure&rsquo;. Functional implications of a band-like anisotropy
Authors: P. P. Lunkenheimer, K. Redmann, H. Scheld, K.-H. Dietl, C. Cryer, K.-D. Richter, J. Merker, W. Whimster
Venue: Technology and Health Care (1997)

Opinions are divided as to whether the rope-like secondary structure, which Torrent-Guasp dissected out of the myocardial body by the blunt unwinding technique (BUT) reveals some kind of functional compartmentation of the heart muscle. The myocardial fibres are aligned parallel to the fibre disruption (cleavage) plane, along which the band has been prepared but they are not necessarily aligned parallel to the long axis of the band. Inconsistencies in the myocardial rope model arise from the obligatory zones of transmural inflection, which are obvious in the base and the apex of both ventricles. They are, however, merely discernible in the midzone of the left ventricular cone. The investigator experienced in BUT knows that the cleavage plane is not unique. We doubt the assumption that the rope structure is the predominant stress transmission pathway, because the fibre strand peel-off technique (SPOT) delivers irregular fibre disruption planes which are definitely different from those which Torrent-Guasp prepares. The rope-like fibre arrangement could be just a redundant structure, a remnant of past developmental steps without, however, any functional implication to the human heart. On the other hand, peeling-off fibre strands from the ventricular wall produces deeply perforating, i.e., oblique transmurally grooved surfaces. Putative functions of force transmission in an oblique transmural direction are (1) ventricular dilation as a function of the variable inclination angle with respect to the epicardial surface, (2) monitoring of ventricular wall stress and ventricular size and (3) segmental stiffening which could serve other dependent segments as a punctum fixum.
Alert Verification Based on Attack Classification in Collaborative Intrusion Detection
Authors: Min Xiao, Debao Xiao
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 02 (2007)

The traditional intrusion detection system has the disadvantages of alert flooding and high false positive due to weak collaboration-awareness. The collaborative intrusion detection mechanism is advocated to overcome shortcomings of traditional IDS and alert verification and correlation are two important techniques to perform collaborative mechanisms. The goal of alert verification is to distinguish the false positives from true positives or confirm the confidence of the alert by integrating context information of protected network with alerts. In this paper, we present an alert verification scheme based on attack classification to achieve the objectives of low cost and high efficiency of verification process.
General Shift-Register Sequences of Arbitrary Cycle Length
Authors: A. R. Smith
Venue: IEEE Transactions on Computers (1971)

An r-ary shift-register sequence is desired that has arbitrary cycle length L=rkfor arbitrary r and k, where k is the number of stages (degree) of the shift register. The existence of such sequences is established for "almost all" cycle lengths L. Furthermore, existence of such sequences which are "zero free" for almost all cycle lengths L is proved.
The Biometrics Grid: A Solution to Biometric Technologies
Authors: Anlong Ming, Huadong Ma
Venue: IEEE Distributed Systems Online (2007)

The biometrics grid can simplify resource management and access by making biometrics data as easy to access as Web pages via a Web browser. It tests user-designed modules, which are wrapped to Web services and deployed into a Web services container. Risk-resilient strategies are used for job scheduling. A case study of two biometrics recognition processes in voiceprint and face illustrates the process. The biometrics grid could benefit academic collaborations and improve biometric data sharing, as well as enhance biometric systems' efficiency in scientific research and commercial applications.
Corporate Level Software Management
Authors: J. D. Cooper
Venue: IEEE Transactions on Software Engineering (1978)

Software management is considered from the corporate headquarters viewpoint. This perspective encompasses all facets of management, but specifically dealt with are those that are brought to bear on software management obstacles and ways to cope with them are presented. Standardization is presented as the most effective management device available at the corporate level for enhancing the overall software posture. Corporate management actions available for favorably influencing the quality of software over its life cycle and research initiatives are described.
A Normalization Framework for Multimedia Databases
Authors: Shi-Kuo Chang, Vincenzo Deufemia, Giuseppe Polese, Mario Vacca
Venue: IEEE Transactions on Knowledge and Data Engineering (2007)

We present a normalization framework for designing of multimedia database schemes with reduced manipulation anomalies. To this end we introduce new extended dependencies involving different types of multimedia data. Such dependencies are based on distance functions that are used to detect semantic relationships between complex data types. Based upon these new dependencies, we have defined five multimedia normal forms. Finally, we have performed a simulation on a large image dataset to analyze the impact of the proposed framework in the context of content-based retrieval applications and in e-learning applications.
A New Scheme of Automatic Semantic Propagation in the Image Data base Using a Hierarchical Structure of Semantics
Authors: Mohammadreza Keyvanpour, Shabnam Asbaghi, Mahmoud Fathy
Venue: Proceedings of the 18th International Conference on Database and Expert Systems Applications (2007)

Automatic semantic propagation is an important technique to complete the image retrieval process which is provided to increase accuracy, speed and performance of image retrieval systems and also to decrease human expenses. In this paper, an automatic approach to propagate the semantics in the image data base is presented. The proposed approach provides a suitable framework for semantic propagation without user's interference at two different levels including local level and global level at the offline mode. This method propagates the related semantics of the image to its similar images based on visual similarity and semantic relations and also, updates the semantic relations between images and the semantic network. Evaluating results of our system provide the acceptable accuracy for semantic image retrieval after doing the automatic semantic propagation process.
Training pi-sigma network by online gradient algorithm with penalty for small weight update
Authors: Yan Xiong, Wei Wu, Xidai Kang, Chao Zhang
Venue: Neural Computation (2007)

A pi-sigma network is a class of feedforward neural networks with product units in the output layer. An online gradient algorithm is the simplest and most often used training method for feedforward neural networks. But there arises a problem when the online gradient algorithm is used for pi-sigma networks in that the update increment of the weights may become very small, especially early in training, resulting in a very slow convergence. To overcome this difficulty, we introduce an adaptive penalty term into the error function, so as to increase the magnitude of the update increment of the weights when it is too small. This strategy brings about faster convergence as shown by the numerical experiments carried out in this letter.
A Rapid Registration Framework for Medical Images
Authors: Anrong Yang, Lingqi Meng, Jianzhen Luo, Caixing Lin
Venue: Proceedings of the Fourth International Conference on Image and Graphics (2007)

This paper presents a general framework for registration of medical images. Comparing with other registration frameworks, this framework is quite simpler in structure but much quicker in image processing and application development. The input data to the registration process are two images: one fixed image and one moving image. The output data are one result image represents the differences between the fixed image and the moving image after registration. Aside the input and output data, the framework can be separated into three parts: interpolator, measurer and optimizer. Interpolator is used for evaluating moving image intensities at nongrid positions. Measurer provides an appraisal method of how well the fixed image is matched by the transformed moving image. Optimizer can optimize the measure criterion with respect to the transform parameters. These three parts act as different roles in medical images registration and construct a simple, rapid and stable medical images registration framework.
The Requirements for Ontologies in Medical Data Integration: A Case Study
Authors: Ashiq Anjum, Peter Bloodsworth, Andrew Branson, Tamas Hauer, Richard McClatchey, Kamran Munir, Dmitry Rogulin, Jetendr Shamdasani
Venue: Proceedings of the 11th International Database Engineering and Applications Symposium (2007)

Evidence-based medicine is critically dependent on three sources of information: a medical knowledge base, the patient's medical record and knowledge of available resources, including where appropriate, clinical protocols. Patient data is often scattered in a variety of databases and may, in a distributed model, be held across several disparate repositories. Consequently addressing the needs of an evidence-based medicine community presents issues of biomedical data integration, clinical interpretation and knowledge management. This paper outlines how the Health-e-Child project has approached the challenge of requirements specification for (bio-) medical data integration, from the level of cellular data, through disease to that of patient and population. The approach is illuminated through the requirements elicitation and analysis of Juvenile Idiopathic Arthritis (JIA), one of three diseases being studied in the EC-funded Health-e- Child project.
Using Trust and Reputation Information to Choose Both Request Responders and Servers in Peer-to-Peer Networks
Authors: Yu Jin, Zhimin Gu, Zhijie Ban
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 01 (2007)

In current reputation-based trust models for P2P applications trust and reputation information are mainly used to choose service providers, they are helpless when facing this malicious attack: malicious nodes respond received queries at random in spite of whether it locally has queried resources. Once they are chosen as a provider, they will transmit a fake, even a malicious file. We present a hierarchical, especially reputation-based two-level trust model. In our model trust and reputation information are used to choose both request responders and service providers. So our model can restrain malicious behaviors from the headstream and withstand this attack. Furthermore in our model peers can receive more and better services; trust value in node can be concentrated at a considerable fast speed and malicious nodes can be identified quickly.
Modeling and Practice on Component Based Software Design - a Case Study
Authors: Wenying Feng, Peter O'Keefe, Shushuang Man
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 01 (2007)

Component software design has been a trend in software engineering. In this paper, the theory of component based design is applied to a real world application, the Graduate Student Information and Reporting system at Trent University. This paper demonstrates how existing components can be used and modified to develop a highly functional and user friendly system in a short amount of time. Transformational design models, analysis by stream functions and state transition machines, white-box and black-box reuse on reporting are discussed in details.
An algorithm for modularization of MAPK and calcium signaling pathways: Comparative analysis among different species
Authors: Losiana Nayak, Rajat K. De
Venue: Journal of Biomedical Informatics (2007)

Signaling pathways are large complex biochemical networks. It is difficult to analyze the underlying mechanism of such networks as a whole. In the present article, we have proposed an algorithm for modularization of signal transduction pathways. Unlike studying a signaling pathway as a whole, this enables one to study the individual modules (less complex smaller units) easily and hence to study the entire pathway better. A comparative study of modules belonging to different species (for the same signaling pathway) has been made, which gives an overall idea about development of the signaling pathways over the taken set of species of calcium and MAPK signaling pathways. The superior performance, in terms of biological significance, of the proposed algorithm over an existing community finding algorithm of Newman [Newman MEJ. Modularity and community structure in networks. Proc Natl Acad Sci USA 2006;103(23):8577-82] has been demonstrated using the aforesaid pathways of H. sapiens.
Single pass streaming BLAST on FPGAs
Authors: Martin C. Herbordt, Josh Model, Bharat Sukhwani, Yongfeng Gu, Tom VanCourt
Venue: Parallel Computing (2007)

Approximate string matching is fundamental to bioinformatics and has been the subject of numerous FPGA acceleration studies. We address issues with respect to FPGA implementations of both BLAST- and dynamic-programming- (DP) based methods. Our primary contribution is a new algorithm for emulating the seeding and extension phases of BLAST. This operates in a single pass through a database at streaming rate, and with no preprocessing other than loading the query string. Moreover, it emulates parameters turned to maximum possible sensitivity with no slowdown. While current DP-based methods also operate at streaming rate, generating results can be cumbersome. We address this with a new structure for data extraction. We present results from several implementations showing order of magnitude acceleration over serial reference code. A simple extension assures compatibility with NCBI BLAST.
An Enhanced Anti-collision Algorithm in RFID Based on Counter and Stack
Authors: Wei-Chih Chen, Shi-Jinn Horng, Pingzhi Fan
Venue: Proceedings of the Second International Conference on Systems and Networks Communications (2007)

Radio Frequency Identification has been developed for many years and it got much attention from researchers recently as there are lots of applications being used practically in the real world. Owing to the shared wireless channel between tags and reader during communication, the tag collision arbitration is a significant issue for reducing the communication overhead. This paper presents a novel anti-collision algorithm named as EAA (Enhanced Anti-collision Algorithm) which is based on ABS (Adaptive Binary Splitting) algorithm proposed by Myung et al. [5], [6]. We improve the ABS algorithm, and inherit the advantages of the ABS algorithm. EAA uses counter, stack, and Manchester code [2], [3], [9] to reduce the probability of collision efficiently. Compared to the methods proposed by other researchers [1], [5] the performance evaluation shows that the proposed scheme in this paper uses fewer timeslots for indentifying tags.