ppxscal/embedding_network huggingface dataset:
An Improved Categorization of Classifier's Sensitivity on Sample Selection Bias
Authors: Wei Fan, Ian Davidson, Bianca Zadrozny, Philip S. Yu
Venue: Proceedings of the Fifth IEEE International Conference on Data Mining (2005)

A recent paper categorizes classifier learning algorithms according to their sensitivity to a common type of sample selection bias where the chance of an example being selected into the training sample depends on its feature vector x but not (directly) on its class label y. A classifier learner is categorized as "local" if it is insensitive to this type of sample selection bias, otherwise, it is considered "global". In that paper, the true model is not clearly distinguished from the model that the algorithm outputs. In their discussion of Bayesian classifiers, logistic regression and hard-margin SVMs, the true model (or the model that generates the true class label for every example) is implicitly assumed to be contained in the model space of the learner, and the true class probabilities and model estimated class probabilities are assumed to asymptotically converge as the training data set size increases. However, in the discussion of naive Bayes, decision trees and soft-margin SVMs, the model space is assumed not to contain the true model, and these three algorithms are instead argued to be "global learners". We argue that most classifier learners may or may not be affected by sample selection bias; this depends on the dataset as well as the heuristics or inductive bias implied by the learning algorithm and their appropriateness to the particular dataset.
An evaluation of component-based software design approaches
Authors: D. Puppin, F. Silvestri, D. Laforenza
Venue: Proceedings of the 2004 IEEE International Symposium on Cluster Computing and the Grid (2004)

Component-oriented software design of Grid applications is commanding growing attention for business and scientific problems. The goal is create applications by assembling together independently developed software components. The components are independently developed, composable, reusable, substitutable software solutions, with clearly defined interface and behaviour.
A numerical algorithm for the nonlinear Kirchhoff string equation
Authors: Jemal Peradze
Venue: Numerische Mathematik (2005)

The initial boundary value problem is considered for the dynamic string equation **. Its solution is found by means of an algorithm, the constituent parts of which are the Galerkin method, the modified Crank-Nicolson difference scheme used to perform approximation with respect to spatial and time variables, and also a Picard type iteration process for solving the system of nonlinear equations obtained by discretization. Errors of the three parts of the algorithm are estimated and, as a result, its total error estimate is obtained.
Protecting Web Servers from Octopus Attacks
Authors: Yoshinori Kobayashi, Eric Y. Chen, Yoshihiro Oyama, Akinori Yonezawa
Venue: Proceedings of the International Symposium on Applications on Internet (2006)

Denial-of-service (DoS) attacks are a major threat to the Internet and have not been completely solved in spite of much research effort. This paper deals with an important class of DoS attacks, called octopus attacks, which establish a flood of connections to a victim web server and prevent legitimate users from connecting to the server.Octopus attacks cause serious performance degradation of the targeted server. In this paper, we propose an approach for protecting web servers against octopus attacks. Our approach deploys an active monitor that monitors the network traffic arriving at a protected server. When there is an excessive number of connections to the server, this monitor resets the connection that is most likely to be an attacker's. We implemented this monitor on a Linux platform. Through experiments, we confirmed that our monitor enabled a web server to provide service to legitimateusers even when octopus attacks were made against the server.
The influence of structural and message features on Web site credibility
Authors: Traci Hong
Venue: Journal of the American Society for Information Science and Technology (2006)

This article explores the associations that message features and Web structural features have with perceptions of Web site credibility. In a within-subjects experiment, 84 participants actively located health-related Web sites on the basis of two tasks that differed in task specificity and complexity. Web sites that were deemed most credible were content analyzed for message features and structural features that have been found to be associated with perceptions of source credibility. Regression analyses indicated that message features predicted perceived Web site credibility for both searches when controlling for Internet experience and issue involvement. Advertisements and structural features had no significant effects on perceived Web site credibility. Institution-affiliated domain names (.gov, .org, .edu) predicted Web site credibility, but only in the general search, which was more difficult. Implications of results are discussed in terms of online credibility research and Web site design. &copy; 2006 Wiley Periodicals, Inc.
Part i. improved handling to geometry details in finite difference time domain method. part ii. method of circuit extraction using finite difference frequency domain matrix formulation with application to power bus modeling
Authors: David J. Pommerenke
Venue:  (2005)

In the first half of this work, a subgridding algorithm with separate spatial and temporal subgridding interfaces is proposed, which makes it possible to analyze and test the spatial and temporal algorithms separately and may also provide additional flexibility. The spatial subgridding method is based on the linear interpolation of the electric and magnetic current densities. The forward and backward coupling schemes are designed to be symmetric, which ensures the stability of the subgridding algorithm. The temporal subgridding method is based on a simple assumption that the field values at the temporal subgridding interface keep constant during one coarse time step. The stability of this scheme is illustrated by using a one-dimensional FDTD model. The full subgridding algorithm combining the two sub-algorithms is also implemented. The stability and accuracy of the subgridding method are tested numerically. The second part of the dissertation proposes a procedure to generate an equivalent circuit network from the Finite Difference Time Domain (FDTD) model. A matrix equation that has the same form of Kirchhoff Current Law (KCL) is derived from the formulation of the Finite Difference Frequency Domain (FDFD) method. Based on the matrix equation, an equivalent circuit can be generated, and the extracted circuit model can be simulated in a SPICE-like solver. Although the generated circuit model does not reduce the complexity of its 3-D full wave counterpart, it provides the possibility of an easy combination of the SPICE circuit and full wave models. The subgridding method is well-suited for the DC power bus modeling. The example models show that the accuracy and efficiency of the proposed method are comparable to the cavity model.
Effective management of simulation and modeling projects
Authors: Joe K. Clema, Dale Rowe, Paul Roth
Venue: ACM SIGSIM Simulation Digest (1979)

Effective management and control of modeling and simulation projects can provide significant savings in the development of large-scale, complex, multidisciplinary systems. With the evolution of the techniques of modeling, simulation and software engineering from "art to science", must come discipline. Discipline is the responsibility of the manager, and for him to effectively control the development of today's projects he must have a detailed understanding of the simulation software phased, cascading life-cycle. With this knowledge, the manager can develop an effective simulation methodology to attack the major cost problems of analysis, design, visibility, testing (verification/validation), standards, concurrent documentation, configuration management, reliability and quality control. To understand the software life-cycle, one must first understand that it is unlike any other product and thus an effective modeling and simulation methodology will require some techniques and mechanisms which differ from the classical management patterns.
A New Face Recognition Algorithm using Bijective Mappings
Authors: Christine Podilchuk, Ankur Patel, Ashwath Harthattu, Saket Anand, Richard Mammone
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Workshops - Volume 03 (2005)

A new face recognition algorithm is proposed which is robust to variations in pose, expression and illumination. The framework is similar to the ubiquitous block matching algorithm used for motion estimation in video compression but has been adapted to compensate for illumination differences. One of the key differentiators of this approach is that unlike traditional face recognition algorithms, the image data representing the face or features extracted from the facial data is not used for classification. Instead, the mapping between the probe and gallery images given by the block matching algorithm is used to classify the faces for recognition. Once the mappings are found for each gallery image, the degree of bijectivity that each mapping produces is used to derive the similarity scores for recognition.
Security market: incentives for disclosure of vulnerabilities
Authors: Peter P. Swire
Venue: Proceedings of the 12th ACM conference on Computer and communications security (2005)

A previous paper by the author proposed a model for when disclosure helps or hurts security, and provided reasons why computer security is often different in this respect than physical security. This paper examines the incentives of actors to disclose vulnerabilities. A chief point of this paper is that the incentives of disclosure depend on two, largely independent, assessments - the degree to which disclosure helps or hurts security, and the degree to which disclosure creates advantages or disadvantages for the organization competitively.The paper presents a 2x3 matrix, where disclosure for security and competition are assessed for three types of systems or software: Open Source; proprietary software; and government systems. Surprisingly, the paper finds significant convergence on disclosure between Open Source and proprietary software. For instance, Open Source security experts often do not disclose configurations and settings, and Open Source programmers often rely on trade secrets (i.e., lack of disclosure) to gain competitive advantage. Similarly, proprietary software often uses more disclosure than assumed. For security, large purchasers and market forces often lead to disclosure about proprietary software. For competitive reasons, proprietary software companies often disclose a great deal in order to seek to become a standard in a competitive space.Despite this greater-than-expected convergence of practice for Open Source and proprietary software, there are strong reasons to believe that less-than-optimal disclosure happens for government systems. The tradition of military secrecy, and the concern about tipping off attackers, leads to a culture of secrecy for government security. Competition for turf, such as the FBI's reputation for not sharing with local law enforcement, further reduces agency incentives to share information about vulnerabilities.
A Taxonomy for Physics Based Synthetic Biometric Models
Authors: Douglas J. Buettner, Nicholas M. Orlans
Venue: Proceedings of the Fourth IEEE Workshop on Automatic Identification Advanced Technologies (2005)

Computer generated "synthetic" biometrics are not widely used within the biometrics community beyond their current use as a research tool. Yet they offer a number of potential advantages that can be developed further to support the science and practical use of biometrics. Physics-based and intermediate-pattern generation of biometrics will require validation of the underlying statistical distributions if they are to be used as more than just a research tool. This paper proposes a taxonomy for physics-based models to be used in the creation of synthetic biometrics.
Unitarily Invariant Metrics on the Grassmann Space
Authors: Li Qiu, Yanxia Zhang, Chi-Kwong Li
Venue: SIAM Journal on Matrix Analysis and Applications (2005)

Let ${\cal G}_{m,n}$ be the Grassmann space of $m$-dimensional subspaces of $\mathbb{F}^{n}$. Denote by $\theta_{1}({{\cal X}, {\cal Y}}), \ldots,\theta_{m}({{\cal X},{\cal Y}})$ the canonical angles between subspaces ${{\cal X}}, {\cal Y} \in \cG_{m,n}$. It is shown that $\Phi(\theta_{1}({{\cal X}, {\cal Y}}),\ldots,\theta_{m}({\cal X}, {\cal Y}))$ defines a unitarily invariant metric on ${\cal G}_{m,n}$ for every symmetric gauge function $\Phi$. This provides a wide class of new metrics on ${\cal G}_{m,n}$. Some related results on perturbation and approximation of subspaces in ${\cal G}_{m,n}$, as well as the canonical angles between them, are also discussed. Furthermore, the equality cases of the triangle inequalities for several unitarily invariant metrics are analyzed.
Superscalar Processor with Multi-Bank Register File
Authors: Tetsuo Hironaka, Moto Maeda, Kazuya Tanigawa, Tetsuya Sueyoshi, Kenichi Aoyama, Tetsushi Koide, Hans Juergen Mattausch, Tadashi Saito
Venue: Proceedings of the Innovative Architecture on Future Generation High-Performance Processors and Systems (2005)

Recently, register files in highly parallel superscalar processors tend to have large chip area and many access ports. This trend causes problems with chip-size, access time and power consumption. As one of the methods for solving these problems, we have proposed a multi-bank register file which realizes small area, high speed and low power consumption. We have proved effectiveness of this method by software simulation, and by detail designing it as synthesizable Verilog-HDL description with a full custom designed multi-bank register file. In this paper we show the detail architecture of a superscalar processor with the multi-bank register file and its evaluation results.
Measuring the Expressiveness of a Constrained Natural Language: An Empirical Study
Authors: Stephen Boyd, Didar Zowghi, Alia Farroukh
Venue: Proceedings of the 13th IEEE International Conference on Requirements Engineering (2005)

It has been suggested that constraining a natural language (NL) reduces the degree of ambiguity of requirement specifications written in that language. There is also a tendency to assume that an inescapable side effect of constraining a natural language is a subsequent reduction in its expressiveness. The primary objective of this paper is to describe a technique that we have developed for empirically measuring the expressiveness of a Constrained Natural Language (CNL) when used to specify the requirements in a particular application domain. Our simple yet practical and repeatable technique elucidates the individual contribution that each lexical entity of the CNL can make on the overall expressiveness of the CNL. This technique is particularly useful for designing new CNLs, as well as situations where tailoring or streamlining existing CNLs for particular application domains is needed.
Hardware/software partitioning and scheduling of embedded systems
Authors: Andrew Morton
Venue:  (2005)

Hardware/software codesign is a design methodology for embedded systems that seeks to satisfy system-level constraints by exploiting the synergy between hardware and software through their concurrent design [71]. During partitioning, design components are assigned to hardware and software implementation targets. The output of the partitioner has a significant impact on the subsequent scheduling of software. This dissertation is a study of the relationship between the partitioning and scheduling of concurrent systems as it pertains to hardware/software codesign. It is structured as three related studies. The first study is on the Earliest Deadline First (EDF) scheduling policy. This is an optimal policy that yields high processor utilization. An algorithm for the off-line feasibility analysis of systems scheduled by EDF is extended in this study to accommodate tasks that employ coprocessors during their execution. This is relevant to software systems that have been partitioned by moving part of the application functionality into hardware coprocessors. The second study is a case study of a real-time kernel that implements the EDF scheduling policy and an automotive application executing on a System on Programmable Chip (SoPC). The application is partitioned by creating a hardware coprocessor. The kernel is also partitioned. The impact on the schedule feasibility of the system is examined for both coprocessors. A metric is also proposed that facilitates comparison of coprocessors, whether for the application or the kernel. The third study is of automated partitioners. The hardware/software partitioning problem is defined such that it includes schedule feasibility and the joint partitioning of application and kernel. A non-linear programming model is created to capture the problem definition and a heuristic is developed based on the Fiduccia/Mattheyses heuristic. Results confirm that the scheduling problem is hard enough that it is not likely to be satisfied unless directly addressed by the partitioner. The results also show that including the kernel in partitioning helps to produce solutions with feasible schedules. The inter-related nature of hardware/software partitioning, and scheduling of concurrent systems is demonstrated through the three studies described above. In the process, scheduling by the preemptive Earliest Deadline First policy is explored in its relation to hardware/software codesign. It is shown that scheduling of concurrent systems needs to be integrated into hardware/software partitioning in order to meet demanding system constraints. Since all three studies focused on single-processor systems, an avenue for further exploration is to consider multi-processor systems.
QoS-aware mobility support architecture for next generation mobile networks: Research Articles
Authors: Abbas Jamalipour, Vinod Mirchandani, M. Rubaiyat Kibria
Venue: Wireless Communications Mobile Computing (2005)

Provision of quality of service (QoS) support with mobility has received impetus from the evolution that has occurred in mobile communication technologies. This is especially the main driver behind 4G&#x002F;B3G networks that will enable a user to access any type of services anytime, anywhere, and anyhow. In this paper, we first review some of the state-of-the-art techniques in the area of QoS and resource management based mobility. We then propose an augmented 4G&#x002F;B3G architecture that addresses key limitations in the salient 4G architectures examined in the literature. Our proposed novel augmentations in mobility, QoS, and resource management schemes consolidate operation of the 4G architecture. The other defining attributes of our proposed 4G architecture are that it is open, hierarchical, layered, and modular with cross-layer coordination and distributed network functionalities. Well-defined message interfaces enable the layers&#x002F;levels within the architecture to support cross-layer coordination under dynamic network conditions. A signaling network that operates independent of the heterogeneous access networks in the architecture is incorporated to carry out wireless system discovery and paging. This facilitates to conserve mobile terminal's battery power. Copyright &copy; 2005 John Wiley & Sons, Ltd.
Intelligent Document Scanning with Active Camera
Authors: Anjin Park, Keechul Jung
Venue: Proceedings of the Eighth International Conference on Document Analysis and Recognition (2005)

Document scanning is important as a prerequisite stage for analysis and recognition. Recently, a lot of researches about document image acquisition using a camera have been attempted, and the camera can be an alternative input device for document scanning if we can solve some problems such as the low resolution. We use an image registration to overcome the low resolution of a camera. An ordinary image registration method needs a pre-processing such as a camera calibration to reduce distortions on the composite. Therefore the ordinary method has an extra running time. In this paper, we propose a component1-based image registration method to concentrate on reducing the distortions and acquiring a seamless image using a PTZ(pan-tilt-zoom) camera without pre-processing. Because we divide the input document image into each component and generate the registration on text components2 using a text-specific characteristic, this method leads to reduce the object(text) distortions on the composite, and we save the extra running time because this method does not perform the post processing.
Behavioral theory for mobile ambients
Authors: Massimo Merro, Francesco Zappa Nardelli
Venue: Journal of the ACM (JACM) (2005)

We study a behavioral theory of Mobile Ambients, a process calculus for modelling mobile agents in wide-area networks, focussing on reduction barbed congruence. Our contribution is threefold. (1) We prove a context lemma which shows that only parallel and nesting contexts need be examined to recover this congruence. (2) We characterize this congruence using a labeled bisimilarity: this requires novel techniques to deal with asynchronous movements of agents and with the invisibility of migrations of secret locations. (3) We develop refined proof methods involving up-to proof techniques, which allow us to verify a set of algebraic laws and the correctness of more complex examples.
Optimal Scheduling in Buffered WDM Interconnects with Limited Range Wavelength Conversion Capability
Authors: Zhenghao Zhang, Yuanyuan Yang
Venue: IEEE Transactions on Computers (2006)

All optical networking is a promising candidate for supporting high-speed communications because of the huge bandwidth of optics. In this paper, we study optimal scheduling in buffered WDM interconnects with limited range wavelength conversion capability. We formalize the problem of maximizing network throughput and minimizing total delay as a problem of finding an optimal matching in a weighted bipartite graph. We then give a simple algorithm, called the Scan and Swap Algorithm, that finds the optimal matching in O(kB) time, where k is the number of wavelengths per fiber and B is the buffer length, as compared to directly adopting other existing algorithms that need at least O(k^{2} N^{2}+k^{2}BN) time, where N is the number of input fibers.
Revisiting Public-Key Cryptography for Wireless Sensor Networks
Authors: Benjamin Arazi, Itamar Elhanany, Ortal Arazi, Hairong Qi
Venue: Computer (2005)

An efficient key distribution mechanism can help keep wireless sensor networks secure.