ppxscal/embedding_network huggingface dataset:
A distributed and cooperative load balancing mechanism for large-scale P2P systems
Authors: Yoshitomo Murata, Hiroyuki Takizawa, Tsutomu Inaba, Hiroaki Kobayashi
Venue: Proceedings of the International Symposium on Applications on Internet Workshops (2006)

This paper proposes a distributed and cooperative scheduling mechanism for dynamic load-balancing on a large-scale distributed computing environment. In the proposed mechanism, the scheduling processes are performed by independent distributed schedulers on individual computing resources. Decentralized mechanisms are more suitable for dynamic load-balancing of a large-scale distributed computing environment than centralized mechanisms in terms of scalability and fault tolerance. Experimental results show that the proposed scheduling mechanism has high scalability and efficiency, without any excessive concentration of processing even if the number of computing resources increases.
A multi-segment image coding and transmission scheme
Authors: G. Pavlidis, A. Tsompanopoulos, N. Papamarkos, C. Chamzas
Venue: Signal Processing (2005)

In this paper, we present a multi-segment image coding scheme suitable for lossless progressive transmission over noisy or congested networks. The method is a block-wise forward-adaptive context selection technique that employs a low-complexity classification process to separate an image into multiple segments according to local statistics, so that compression efficiency by an entropy coder is improved and progressive transmission becomes possible. At the same time, loss of information in case of error occurrence during transmission results in less obvious quality degradation as the lost blocks are scattered in the final image. The scheme was extensively tested and turned out to give results comparable to those given by state-of-the-art standards, such as L-JPEG, JPEG-LS, CALIC and FELICS, in terms of compression efficiency, while providing with scalability and error concealment mechanisms.
Privacy Aware Data Generation for Testing Database Applications
Authors: Xintao Wu, Chintan Sanghvi, Yongge Wang, Yuliang Zheng
Venue: Proceedings of the 9th International Database Engineering & Application Symposium (2005)

Testing of database applications is of great importance. A significant issue in database application testing consists in the availability of representative data. In this paper we investigate the problem of generating a synthetic database based on a-priori knowledge about a production database. Our approach is to fit general location model using various characteristics (e.g., constraints, statistics, rules) extracted from the production database and then generate the synthetic data using model learnt. The generated data is valid and similar to real data in terms of statistical distribution, hence it can be used for functional and performance testing. As characteristics extracted may contain information which may be used by attacker to derive some confidential information about individuals, we present our disclosure analysis method which applies cell suppression technique for identity disclosure analysis and perturbation for value disclosure.
XPAND: An Efficient Test Stimulus Compression Technique
Authors: Subhasish Mitra, Kee Sup Kim
Venue: IEEE Transactions on Computers (2006)

Combinational circuits implemented with exclusive-or gates are used for on-chip generation of deterministic test patterns from compressed seeds. Unlike major test compression techniques, this technique doesn't require test pattern generation with don't cares. Experimental results on industrial designs demonstrate that this new XPAND technique achieves exponential reduction in test data volume and test time compared to traditional scan and significantly outperforms existing test compression tools. The XPAND technique is currently being used by several industrial designs.
Simulated Annealing based Localization in Wireless Sensor Network
Authors: Anushiya A. Kannan, Guoqiang Mao, Branka Vucetic
Venue: Proceedings of the The IEEE Conference on Local Computer Networks 30th Anniversary (2005)

In sensor networks, the information obtained from sensors will be meaningless without the location information. In this paper, we propose a simulated annealing based localization (SAL) scheme for wireless sensor networks. Simulated annealing (SA) is used to estimate the approximate solution to combinatorial optimization problems.The SAL scheme can bring the convergence out of the local minima in a controlled fashion. Simulation results show that this scheme gives accurate and consistent location estimates of the nodes.
Learning through Changes: An Empirical Study of Dynamic Behaviors of Probability Estimation Trees
Authors: Kun Zhang, Zujia Xu, Jing Peng, Bill Buckles
Venue: Proceedings of the Fifth IEEE International Conference on Data Mining (2005)

In practice, learning from data is often hampered by the limited training examples. In this paper, as the size of training data varies, we empirically investigate several probability estimation tree algorithms over eighteen binary classification problems. Nine metrics are used to evaluate their performances. Our aggregated results show that ensemble trees consistently outperform single trees. Confusion factor trees(CFT) register poor calibration even as training size increases, which shows that CFTs are potentially biased if data sets have small noise. We also provide analysis on the observed performance of the tree algorithms.
Time-space lower bounds for satisfiability
Authors: Lance Fortnow, Richard Lipton, Dieter van Melkebeek, Anastasios Viglas
Venue: Journal of the ACM (JACM) (2005)

We establish the first polynomial time-space lower bounds for satisfiability on general models of computation. We show that for any constant c less than the golden ratio there exists a positive constant d such that no deterministic random-access Turing machine can solve satisfiability in time nc and space nd, where d approaches 1 when c does. On conondeterministic instead of deterministic machines, we prove the same for any constant c less than &2radic;.Our lower bounds apply to nondeterministic linear time and almost all natural NP-complete problems known. In fact, they even apply to the class of languages that can be solved on a nondeterministic machine in linear time and space n1/c.Our proofs follow the paradigm of indirect diagonalization. We also use that paradigm to prove time-space lower bounds for languages higher up in the polynomial-time hierarchy.
Measuring, monitoring, and assessing software process using pampa 2.0 knowledge-based system
Authors: Jin Hwan Jung
Venue:  (2004)

My research is about monitoring the software development process to assess Capability maturity level. Capability Maturity Model (CMM) was developed to improve the software process based on subjective assessment by teams of experts. We propose an objective CMM assessment, which replaces expensive and time-consuming human effort by a knowledge-based system. Compared to Subjective CMM assessment, Objective CMM assessment can be less expensive, takes less time, and is easy to estimate the software development environment maturity. The accuracy of Objective CMM assessment can be the same as Subjective CMM assessment if enough activities are represented as objective activities. For example, if subjective activities total 80% and objective activities total 20%, then the accuracy of Objective CMM assessment is not reliable. It would be reliable if the objective activity is increased up to 80% from 20%. This dissertation presents how to change from Subjective CMM assessment to Objective CMM assessment, and we will prove that Objective CMM Assessment is effective.
Integrating Information Assurance (IA) into K-5 curriculum
Authors: Tammy Alexander, Casey C. Rackley
Venue: Proceedings of the 2nd annual conference on Information security curriculum development (2005)

This paper addresses the need for Information Assurance (IA) curriculum at the primary-school level and will demonstrate how IA curriculum can be mapped to current primary-school technology programs. This is a work in progress. This paper will outline the steps needed to conduct a pilot program at a local elementary school, show how the curriculum is integrated, and give an overview of possible barriers faced during this process.
ScatterType: A Legible but Hard-to-Segment CAPTCHA
Authors: Henry S. Baird, Michael A. Moll, Sui-Yu Wang
Venue: Proceedings of the Eighth International Conference on Document Analysis and Recognition (2005)

The ScatterType CAPTCHA, designed to resist character- segmentation attacks and shown to be highly legible to human readers, is analyzed for vulnerabilities and is offered for experiments in automatic attack. As introduced in [BR05], 'ScatterType' challenges are images of machine-print text whose characters are cut into pieces which then drift apart, in an attempt to frustrate segment-then-recognize computer vision attacks. Analysis of experimental human legibility data has shown that better than 95% correct legibility can be achieved through judicious choice of the pseudorandom generating parameters [BMW05]. That analysis is summarized and discussed here as motivation for a discussion of potential vulnerabilities. An invitation to attack ScatterType is offered.
Process Diagnosis via Electrical-Wafer-Sorting Maps Classification
Authors: Federico Di Palma, Giuseppe De Nicolao, Guido Miraglia, Oliver M. Donzelli
Venue: Proceedings of the Fifth IEEE International Conference on Data Mining (2005)

The commonality analysis is a proven tool for fault detection in semiconductor manufacturing. This methodology extracts subsets of production lots from all the available data. Then, data mining techniques are used only on the selected data. This approach loses part of the available information and does not discriminate among the lots. The new methodology performance the automatic classificationof the electrical wafer test maps in order to identify the classes of failure present in the production lots. Subsequently, the proposed procedure uses the process history of each wafer to create a list of the root cause candidates. This methodology is the core of the software tool ACID which is currently used for process diagnosis at the Agrate site of the ST Microelectronics. A real analysis is presented.
From databases to dataspaces: a new abstraction for information management
Authors: Michael Franklin, Alon Halevy, David Maier
Venue: ACM SIGMOD Record (2005)

The development of relational database management systems served to focus the data management community for decades, with spectacular results. In recent years, however, the rapidly-expanding demands of "data everywhere" have led to a field comprised of interesting and productive efforts, but without a central focus or coordinated agenda. The most acute information management challenges today stem from organizations (e.g., enterprises, government agencies, libraries, "smart" homes) relying on a large number of diverse, interrelated data sources, but having no way to manage their dataspaces in a convenient, integrated, or principled fashion. This paper proposes dataspaces and their support systems as a new agenda for data management. This agenda encompasses much of the work going on in data management today, while posing additional research objectives.
HW/SW Co-Design for SoC on Mobile Platforms, invited
Authors: Johan van der Tang, Harm van Rumpt, Dieter Kasperkovitz
Venue: Proceedings of the Fifth International Workshop on System-on-Chip for Real-Time Applications (2005)

Portable platforms like cell phones, PDA¿s, and notebooks get more and more feature-packed every year. Given the very short life-cycles of these products, the set-maker has to be able to add additional selling-features like for example FM/AM radio, TV, and wireless links with a minimum of risk, board space, minimum power consumption and cost onto it¿s already existing product platform. Systems on Chip (SoC) in their truest sense, having no external components, and that are optimized for flexibility and low power consumption are the solution to this challenge. This paper discusses the key features and key circuits of the first "no-external components" FM radio and TV tuners for mobile platforms. Both SoCs make use of resources that are generally available on mobile platforms like a reference clock and a microprocessor. The signal processing path of both ICs is fully controlled by software and adaptable as a result of hardware/software co-design. For the set-maker, both ICs can be virtually treated as digital ICs as there are no "hot" RF components off-chip, nor is any other component off-chip. RF building blocks like a broadband tunable LNA (on the TV IC) and a I/Q oscillator (on the FM IC and TV IC) are discussed in detail.
Precise identification of composition relationships for UML class diagrams
Authors: Ana Milanova
Venue: Proceedings of the 20th IEEE/ACM international Conference on Automated software engineering (2005)

Knowing which associations are compositions is important in a tool for the reverse engineering of UML class diagrams. Firstly, recovery of composition relationships bridges the gap between design and code. Secondly, since composition relationships explicitly state a requirement that certain representations cannot be exposed, it is important to determine if this requirement is met by component code. Verifying that compositions are implemented properly may prevent serious program flaws due to representation exposure.We propose an implementation-level composition model based on ownership and a novel approach for identifying compositions in Java software. Our approach uses static ownership inference based on points-to analysis and is designed to work on incomplete programs. In our experiments, on average 40% of the examined fields account for relationships that are identified as compositions. We also present a precision evaluation which shows that for our code base our analysis achieves almost perfect precision---that is, it almost never misses composition relationships. The results indicate that precise identification of interclass relationships can be done with a simple and inexpensive analysis, and thus can be easily incorporated in reverse engineering tools that support iterative model-driven development.
Petascale Computational Systems
Authors: Gordon Bell, Jim Gray, Alex Szalay
Venue: Computer (2006)

A balanced cyberinfrastructure is necessary to meet growing data-intensive scientific needs.
A developmental genetics-inspired approach to robot control
Authors: Sanjeev Kumar
Venue: Proceedings of the 2005 workshops on Genetic and evolutionary computation (2005)

The need to build modular, scalable, and complex technology capable of adaptation, self-assembly, and self-repair has fuelled renewed interest in using approaches inspired by developmental biology. To meet this need, a new field, called Computational Development (CD), has emerged. Its focus is on adapting processes and mechanisms from developmental biology so as to help us build scalable, complex technology. Due to the embryonic nature of the field, however, research investigating the potential of such approaches for different problem domains is crucial to its success. In this paper, the plausibility of applying a developmental biology-inspired approach to the demanding problem domain of reactive robot control is explored. Using developmental genetics as a source of inspiration, a model of genetic regulatory networks is used in conjunction with a spatially distributed evolutionary algorithm to evolve real-time robot controllers for tasks such as general purpose obstacle avoidance.
Designing A.ne Transformations based Face Recognition Algorithms
Authors: Pranab K. Mohanty, Sudeep Sarkar, Rangachar Kasturi
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Workshops - Volume 03 (2005)

We investigate methods to infer the best afine transformation based face recognition algorithm; which operates by projecting given images to a low-dimensional space, followed by distance computations. This category includes the following well known methods for recognition: the Principal Component Analysis (PCA), Linear Discriminant Analysis(LDA), and Independent Component Analysis (ICA). The desired afine transformation is not restricted to that which results in an orthogonal space and can involve shear and stretch. We adopt an approach that has a reverse engineering flavor. Starting from distances computed by any face recognition algorithm, such as the FRGC baseline algorithm, we learn the best afine transform that approximates it. We propose a closed form solution for this based on classical Multidimensional Scaling (MDS). Next, this afine transform is refined by considering the modification of a given distance matrix, which will enhance the separation of match and non-match scores. The afine transform that produces the best Receiver Operating Characteristic (ROC) is selected. The data from Face Recognition Grand Challenge (FRGC-v2.0) reveals that learned afine transformation results in a better performance than the FRGC baseline algorithm.
Une formalisation du contexte dans les environnements coop&eacute;ratifs nomades
Authors: Manuele Kirsch-Pinheiro, Marlène Villanova-Oliver, Jérôme Gensel, Hervé Martin
Venue: Proceedings of the 2nd French-speaking conference on Mobility and ubiquity computing (2005)

In this paper, we propose an object oriented model for describing a mobile user's context inside a Web-based groupware system. These systems are confronted to the growing use of mobile devices, such as laptops, PDAs or cellular phones, which requires special context-aware capabilities. Our model formalizes the context notion, decoupling context and system information, which consequently reduces the system development complexity. We consider the context as a set of basic elements that identify the circumstances in which the user is accessing the system. These elements include elements related to physical aspects (the user's location and device), as well as those related to the cooperative process in which the user is involved (group, role, activities, etc.).
Sonification design and metaphors: Comments on Walker and Kramer, ICAD 1996
Authors: Bruce N. Walker, Gregory Kramer
Venue: ACM Transactions on Applied Perception (TAP) (2005)

The original Walker and Kramer paper at ICAD 1996 studied the mapping of data dimensions (e.g., temperature) onto sound dimensions (e.g., pitch). In this commentary we consider the historical and methodological context of that early work, discuss its relevance to the field of auditory display, and point out how it forms part of a body of work with ties to other researchers in the ICAD community.
Preserving the Big Picture: Visual Network Traffic Analysis with TN
Authors: John R. Goodall, Wayne G. Lutters, Penny Rheingans, Anita Komlodi
Venue: Proceedings of the IEEE Workshops on Visualization for Computer Security (2005)

When performing packet-level analysis in intrusion detection, analysts often lose sight of the "big picture" while examining these low-level details. In order to prevent this loss of context and augment the available tools for intrusion detection analysis tasks, we developed an information visualization tool, the Time-based Network traffic Visualizer (TNV). TNV is grounded in an understanding of the work practices of intrusion detection analysts, particularly foregrounding the overarching importance of context and time in the process of intrusion detection analysis. The main visual component of TNV is a matrix showing network activity of hosts over time, with connections between hosts superimposed on the matrix, complemented by multiple, linked views showing port activity and the details of the raw packets. Providing low-level textual data in the context of a high-level, aggregated graphical display enables analysts to examine packetlevel details within the larger context of activity. This combination has the potential to facilitate the intrusion detection analysis tasks and help novice analysts learn what constitutes "normal" on a particular network.
Ridge regression in two-parameter solution: Research Articles
Authors: Stan Lipovetsky, W. Michael Conklin
Venue: Applied Stochastic Models in Business and Industry (2005)

We consider simultaneous minimization of the model errors, deviations from orthogonality between regressors and errors, and deviations from other desired properties of the solution. This approach corresponds to a regularized objective that produces a consistent solution not prone to multicollinearity. We obtain a generalization of the ridge regression to two-parameter model that always outperforms a regular one-parameter ridge by better approximation, and has good properties of orthogonality between residuals and predicted values of the dependent variable. The results are very convenient for the analysis and interpretation of the regression. Numerical runs prove that this technique works very well. The examples are considered for marketing research problems. Copyright &copy; 2005 John Wiley & Sons, Ltd.
Routing and resource discovery in Phoenix Grid-enabled message passing library
Authors: K. Kaneda, K. Taura, A. Yonezawa
Venue: Proceedings of the 2004 IEEE International Symposium on Cluster Computing and the Grid (2004)

We describe the design and implementation of a "Grid-enabled" message passing library, in the context of the Phoenix message passing model. It supports: (1) message routing between nodes not directly reachable due to firewalls and/or NAT; (2) resource discovery facilitating ease of configuration that allows nodes without static names; (e.g., DHCP nodes) to participate in computation without specific efforts; and (3) nodes dynamically joining/leaving computation at runtime. We argue that, in future Grid environments, all of the above functions, not just routing across firewalls, will become important issues of Grid-enabled message passing systems including MPI. Unlike solutions commonly proposed by previous work on a Grid-enabled MPI, our system runs a distributed resource discovery and routing table construction algorithm, rather than assuming all such pieces of information are available in a static configuration file or alike. Experimental results using 400 nodes in three LAN indicate that our algorithm is able to dynamically discover participating peers, connect them to each other and calculate a routing table. The elapsed time of our algorithm is only approximately twice as long as that of offline route calculation that just connects nodes based on a fully given configuration.
The Visual Code Navigator: An Interactive Toolset for Source Code Investigation
Authors: Gerard Lommerse, Freek Nossin, Lucian Voinea, Alexandru Telea
Venue: Proceedings of the Proceedings of the 2005 IEEE Symposium on Information Visualization (2005)

We present the Visual Code Navigator, a set of three interrelated visual tools that we developed for exploring large source code software projects from three different perspectives, or views: The syntactic view shows the syntactic constructs in the source code. The symbol view shows the objects a file makes available after compilation, such as function signatures, variables, and namespaces. The evolution view looks at different versions in a project lifetime of a number of selected source files. The views share one code model, which combines hierarchical syntaxbased and line-based information from multiple source files versions. We render this code model using a visual model that extends the pixel-filling, space partitioning properties of shaded cushion treemaps with novel techniques. We discuss how our views allow users to interactively answer complex questions on various code elements by simple mouse clicks. We validate the efficiency and effectiveness of our toolset by an informal user study on the source code of VTK, a large, industry-size C++ code base.