ppxscal/embedding_network huggingface dataset:
Fast high-quality noise
Authors: Jeppe Revall Frisvad, Geoff Wyvill
Venue: Proceedings of the 5th international conference on Computer graphics and interactive techniques in Australia and Southeast Asia (2007)

At the moment the noise functions available in a graphics programmer's toolbox are either slow to compute or they involve grid-line artifacts making them of lower quality. In this paper we present a real-time noise computation with no grid-line artifacts or other regularity problems. In other words, we put a new tool in the box that computes fast high-quality noise. In addition to being free of artifacts, the noise we present does not rely on tabulated data (everything is computed on the fly) and it is easy to adjust quality vs. quantity for the noise. The noise is based on point rendering (like spot noise), but it extends to more than two dimensions. The fact that it is based on point rendering makes art direction of the noise much easier.
The Modular Structure of Complex Systems
Authors: D. L. Parnas
Venue: IEEE Transactions on Software Engineering (1985)

This paper discusses the organization of software that is inherently complex because of very many arbitrary details that must be precisely right for the software to be correct. We show how the software design technique known as information hiding, or abstraction, can be supplemented by a hierarchically structured document, which we call a module guide. The guide is intended to allow both designers and maintainers to identify easily the parts of the software that they must understand, without reading irrelevant details about other parts of the software. The paper includes an extract from a software module guide to illustrate our proposals.
Methods and Technologies for Enhancing and Optimizing Power Plant Inspection Procedures
Authors: Kamen Kanev, Zixue Cheng, Nikolay Mirenkov
Venue: Proceedings of the 7th IEEE International Conference on Computer and Information Technology (2007)

This paper considers different methods and approaches for improving power plant inspection procedures through innovative technological means. Main objectives are to provide timely, context dependent assistance and advice to human inspectors of power plant facilities, to minimize human errors and to increase inspection efficiency and reliability. A solution based on spatial awareness methods for inspector localization, registration and tracking through remote sensing of RFID tags and digital codes embedded in the surrounding environment is proposed. Possible extensions for industrial inspection robots are briefly discussed and potential applicability in nuclear power plant inspections is revealed.
On the Effectiveness of Laplacian Normalization for Graph Semi-supervised Learning
Authors: Rie Johnson, Tong Zhang
Venue: The Journal of Machine Learning Research (2007)

This paper investigates the effect of Laplacian normalization in graph-based semi-supervised learning. To this end, we consider multi-class transductive learning on graphs with Laplacian regularization. Generalization bounds are derived using geometric properties of the graph. Specifically, by introducing a definition of graph cut from learning theory, we obtain generalization bounds that depend on the Laplacian regularizer. We then use this analysis to better understand the role of graph Laplacian matrix normalization. Under assumptions that the cut is small, we derive near-optimal normalization factors by approximately minimizing the generalization bounds. The analysis reveals the limitations of the standard degree-based normalization method in that the resulting normalization factors can vary significantly within each connected component with the same class label, which may cause inferior generalization performance. Our theory also suggests a remedy that does not suffer from this problem. Experiments confirm the superiority of the normalization scheme motivated by learning theory on artificial and real-world data sets.
Analysis of the Multiple-Attribute-Tree Data-Base Organization
Authors: R. L. Kashyap
Venue: IEEE Transactions on Software Engineering (1977)

The multiple-attribute-tree (MAT) data-base organization is modeled and analyzed. Average retrieval time per query is obtained using a statistical estimation procedure and computationally efficient cost equations are presented. These cost equations are validated using a small experimental data base. Several real-life and generated data bases are used to demonstrate the effectiveness of the multiple-attribute-tree organization in reducing the expected retrieval time per query over conventional methods.
Design Planning in End-User Web Development
Authors: Mary Beth Rosson, Hansa Sinha, Mithu Bhattacharya, Dejin Zhao
Venue: Proceedings of the IEEE Symposium on Visual Languages and Human-Centric Computing (2007)

We report an exploratory study of the impacts of design planning on end users asked to develop a simple interactive web application. Some participants were asked to create a conceptual map to plan their projects and others to write scenarios; a third group was asked to do whatever they found useful. We describe the planning that each group underwent, how they approached the web development task, and their reactions to the experience afterwards. We also discuss how participants' gender and experience was related to their web development activities.
A framework for projected clustering of high dimensional data streams
Authors: Charu C. Aggarwal, Jiawei Han, Jianyong Wang, Philip S. Yu
Venue: Proceedings of the Thirtieth international conference on Very large data bases - Volume 30 (2004)

The data stream problem has been studied extensively in recent years, because of the great ease in collection of stream data. The nature of stream data makes it essential to use algorithms which require only one pass over the data. Recently, single-scan, stream analysis methods have been proposed in this context. However, a lot of stream data is high-dimensional in nature. High-dimensional data is inherently more complex in clustering, classification, and similarity search. Recent research discusses methods for projected clustering over high-dimensional data sets. This method is however difficult to generalize to data streams because of the complexity of the method and the large volume of the data streams. In this paper, we propose a new, high-dimensional, projected data stream clustering method, called HPStream. The method incorporates a fading cluster structure, and the projection based clustering methodology. It is incrementally updatable and is highly scalable on both the number of dimensions and the size of the data streams, and it achieves better clustering quality in comparison with the previous stream clustering methods. Our performance study with both real and synthetic data sets demonstrates the efficiency and effectiveness of our proposed framework and implementation methods.
Analysis of Sidelobe Elevation for Polyphase Complementary Codes through the Non-ideal System
Authors: Debin Pang, Ning Zhang
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 03 (2007)

Complementary phase-coded signals have found widespread use in radar systems utilizing pulse compression technique due to their unique autocorrelation properties. However, nonzero sidelobe values appear when the complementary signals pass through the system with limited bandwidth. This paper gives a detailed discussion on the impact of passband cutoff frequency, passband ripple, transition bandwidth, and minimum stopband attenuation of FIR digital filter on sidelobe elevation. At last this paper gets some useful conclusions which are conducive to system design optimization and sidelobe suppression research.
Automatic Extraction of Data from 2-D Plots in Documents
Authors: X. Lu, J. Wang, P. Mitra, C. L. Giles
Venue: Proceedings of the Ninth International Conference on Document Analysis and Recognition - Volume 01 (2007)

Two-dimensional (2-D) plots in digital documents contain important information. Often, the results of scientific experiments and performance of businesses are summarized using plots. Although 2-D plots are easily understood by human users, current search engines rarely utilize the information contained in the plots to enhance the results returned in response to queries posed by end- users. We propose an automated algorithm for extracting information from line curves in 2-D plots. The extracted information can be stored in a database and indexed to answer end-user queries and enhance search results. We have collected 2-D plot images from a variety of resources and tested our extraction algorithms. Experimental evaluation has demonstrated that our method can produce results suitable for real world use.
On System Diagnosability in the Presence of Hybrid Faults
Authors: A. Sengupta
Venue: IEEE Transactions on Computers (1986)

This correspondence deals with the problem of testing the diagnosmbllity of a system in presence of hybrid faults (that is, when some of the units of the system have failed intermittently and some have failed permanently). Presence of intermittent faults can lead to incomplete diagnosis and usually complicates the diagnosis problem in comparison to permanent fault situation. Alternative characterizations for hybrid fault diagnosability of a system to those originally presented in [3] are derived in this paper. It is shown that these conditions lead to the testing of the hybrid diagnosability of a system with fewer computations than that in [3].
Using ada in a service-Ooriented architecture
Authors: Ricky E. Sward
Venue: Proceedings of the 2007 ACM international conference on SIGAda annual international conference (2007)

One of the latest trends in software architecture is known as a Service-Oriented Architecture (SOA). This paper describes SOA briefly and one of the enabling technologies of SOA, namely the Enterprise Service Bus (ESB). The paper goes on to describe two ways in which Ada applications can be built as services in a SOA. The first method is to build the Ada code as a Dynamically Linked Library (DLL) and wrap it in Java code. The second method is to use the Ada Web Server (AWS) and build a direct interface to the Ada code that is needed to plug into the ESB.
Vault: A Secure Binding Service
Authors: Guor-huar Lu, Changho Choi, Zhi-li Zhang
Venue: Proceedings of the Proceedings of the 2006 IEEE International Conference on Network Protocols (2006)

Binding services are crucial building blocks in networks and networked applications. A binding service (e.g., the Domain NameSystem (DNS)) maps certain information, namely, binding keys (e.g., host names), to other information, i.e., binding values(e.g., IP addresses), and answers queries for such key-value bindings. Clearly, building secure binding services that ensurethe integrity and authenticity of bindings are vital to the correct operations of many networks and networked applications.In this paper we present a novel approach for building generic secure binding services that allow arbitrary key-value bindingsas (trusted) infrastructure services to support a variety of networks and networked applications. We combine the Identity-BasedEncryption (IBE) crypto-mechanisms with distributed hash table (DHT) techniques to develop an innovative architecture forbuilding scalable, robust and secure binding services. Using this architecture, we implement a prototype system called Vaultand evaluate its performance both in a local testbed and on the PlanetLab.
Ga-based passive loop optimization for magnetic field mitigation of transmission lines
Authors: Pedro Cruz, Jesús M. Riquelme, Antonio de la Villa, José L. Martínez
Venue: Neurocomputing (2007)

This paper presents a systematic method to assist in the design of passive loops with the aim of mitigating the magnetic field generated by overhead transmission lines. The procedure is based on a two-dimensional (2D) modeling of the magnetic field, using a genetic algorithm (GA) to obtain the optimal mitigation design both for non-compensated and compensated coils. The proposed technique is applied to a horizontal line using three different passive mitigating configurations. Numerical results of the convergence and mitigation effectiveness, as well as discussion of the results, are provided.
Structures, semantics and statistics
Authors: Alon Y. Halevy
Venue: Proceedings of the Thirtieth international conference on Very large data bases - Volume 30 (2004)

At a fundamental level, the key challenge in data integration is to reconcile the semantics of disparate data sets, each expressed with a different database structure. I argue that computing statistics over a large number of structures offers a powerful methodology for producing semantic mappings, the expressions that specify such reconciliation. In essence, the statistics offer hints about the semantics of the symbols in the structures, thereby enabling the detection of semantically similar concepts. The same methodology can be applied to several other data management tasks that involve search in a space of complex structures and in enabling the next-generation on-the-fly data integration systems.
Separate Compilation and Partial Specification in Pascal
Authors: A. Celentano
Venue: IEEE Transactions on Software Engineering (1980)

Separate compilation is a useful tool in the development, debugging, testing, and integration of modular systems.
Test Efficiency Analysis and Improvement of SOC Test Platforms
Authors: Tong-Yu Hsieh, Kuen-Jong Lee, Jian-Jhih You
Venue: Proceedings of the 16th Asian Test Symposium (2007)

Employing a test platform in an SOC design has been shown to be an effective method for SOC testing. However the test efficiency problem of a test platform has not been addressed. In this paper, we formally analyze the test efficiency of test platforms and seek for its optimization. We formulate the required numbers of test cycles for test platforms implemented with different test structures and/or executed with different test procedures. It is shown that up to 24X test time difference for platforms with different test structures/procedures is possible. Based on the derived formula, an appropriate test platform that can achieve best test efficiency with minimal area overhead can be determined.
Research on Chinese Paper-cut CAD System
Authors: Dongmei Peng, Shouqian Sun, Lusheng Pan
Venue: Proceedings of the Fourth International Conference on Image and Graphics (2007)

The status of the Chinese paper-cut is not optimistic. How to use the latest technology and information technology to strengthen protection of this non-material cultural heritage and its cultural existence style, which is currently the focus of our research group. We find out the most basic element symbols of paper-cut from large quantities of images, and build the paper-cut basic elements database, the paper-cut commonly used symbols database, the paper-cut images database, lay a solid foundation for innovative forms & content of paper-cut. At the same time, we probe into composition of paper-cut art design system and its function from the system design ideas and structures and how to use it to lay a good foundation for the establishment of the CAD system.
Quality Assessment of Gaussian Blurred Images Using Symmetric Geometric Moments
Authors: Chong-Yaw Wee, Raveendran Paramesran, R. Mukundan
Venue: Proceedings of the 14th International Conference on Image Analysis and Processing (2007)

A novel objective full-reference image quality assessment metric based on symmetric geometric moments (SGM) is proposed. SGM is used to represent the structural information in the reference and test images. The reference and test images are divided into (8 × 8) blocks and the SGM up to fourth order for each block is computed. SGM of the corresponding blocks of the reference and test images are used to form the correlation index or quality metric of each block. The correlation index of the test image is then obtained by taking the average of all blocks. The performance of the proposed metric is validated through subjective evaluation by comparing with objective methods (PSNR and MSSIM) on a database of 174 Gaussian blurred images. The proposed metric performs better than PSNR and MSSIM by providing larger correlation coefficients and smaller errors after nonlinear regression fitting.
Contribution to the e-learning brokerage systems using semantic technologies
Authors: Juan M. Santos, Luis Anido, Martín Llamas
Venue: Proceedings of the sixth conference on IASTED International Conference Web-Based Education - Volume 2 (2007)

Popular search engines, like Google or Yahoo!, provide good results based on Information Retrieval theories. Nevertheless, they are not context-specific and offer limited efficiency in areas like online learning. This paper proposes a brokerage system for e-learning that overcomes some of the drawbacks found in current portals offering generic access to online courses. The use of available Learning Technology (LT) standards and underlying semantic support provides better personalization and use of context-specific information. Thus, location of suitable online courses is improved over the current situation.
A Study on the Control of Nonlinear System Using Growing RBFN and Reinforcement Learning
Authors: Hyun Seob Cho
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 05 (2007)

The proposed approach is neural-network based and combines the self-tuning principle with reinforcement learning. The proposed control scheme consists of a controller, a utility estimator, an exploration module, a learning module and a rewarding module. The controller and the utility estimator are implemented together in a single Radial Basis Function Network (RBFN). The learning method involves structural adaptation (growing RBFN) and parameter adaptation. No prior knowledge of the plant is assumed, and the controller has to begin with exploration of the state space. The exploration versus exploitation dilemma of reinforcement learning is solved through smooth transitions between the two modes. The controller is capable of asymptotically approaching the desired reference trajectory, which is showed in simulation result.
Proposal of a Complete Life Cycle In-Process Measurement Model Based on Evaluation of an In-Process Measurement Experiment Using a Standardized Requirement Definition Process
Authors: Yoshiki Mitani, Tomoko Matsumura, Mike Barker, Seishiro Tsuruho, Katsuro Inoue, Ken-Ichi Matsumoto
Venue: Proceedings of the First International Symposium on Empirical Software Engineering and Measurement (2007)

This paper focuses on in-process measurements during requirements definition where measurements of processes and products are relatively difficult. However, development processes in Japan based on the Enterprise Architecture method provide standardized formats for such upstream processes and products, allowing in-process measurements. Based on previous work and on this examination of in-process measurements of requirements definition with the Enterprise Architecture method and previous results of empirical studies of in-process measurements and empirically validates of later development processes, this paper proposes a new measurement model, the "Full In-Process Process and Product (I-PAP) Measurement Model," which includes the complete software development process from requirements to maintenance. Standardization of the requirements definition phase using the Enterprise Architecture method in Japan allows in-process measurement across the complete development lifecycle. Combining this with collaborative filtering and a project benchmark database will support project evaluation, estimation, and prediction.
Communicating Risk Information in Agile and Traditional Environments
Authors: Jaana Nyfjord, Mira Kajko-Mattsson
Venue: Proceedings of the 33rd EUROMICRO Conference on Software Engineering and Advanced Applications (2007)

Structured and disciplined communication is a prerequisite for the effective management of risks. In this paper, we investigate what risk management information is communicated in traditional and agile development environments. Our goal is to find out whether there is any difference in the way risks are communicated. We do this by studying the management of risk information within three Canadian organizations. Our results show that there are few differences between the information as communicated in these traditional and agile environments.
Understanding User Centricity
Authors: Jeff Patton
Venue: IEEE Software (2007)

This new column will cover user centricity as it applies to software design and development. It will include real-world examples of common problems in software development and describe simple techniques for solving such problems.
Botanical Tree Image Generation
Authors: Masaki Aono, Tosiyasu Kunii
Venue: IEEE Computer Graphics and Applications (1984)

It may be true, as the poet said, that ¿...only God can make a tree,¿ but through geometric modeling a computer graphics system can produce a remarkable likeness.
Topic taxonomy adaptation for group profiling
Authors: Lei Tang, Huan Liu, Jianping Zhang, Nitin Agarwal, John J. Salerno
Venue: ACM Transactions on Knowledge Discovery from Data (TKDD) (2008)

A topic taxonomy is an effective representation that describes salient features of virtual groups or online communities. A topic taxonomy consists of topic nodes. Each internal node is defined by its vertical path (i.e., ancestor and child nodes) and its horizonal list of attributes (or terms). In a text-dominant environment, a topic taxonomy can be used to flexibly describe a group's interests with varying granularity. However, the stagnant nature of a taxonomy may fail to timely capture the dynamic change of a group's interest. This article addresses the problem of how to adapt a topic taxonomy to the accumulated data that reflects the change of a group's interest to achieve dynamic group profiling. We first discuss the issues related to topic taxonomy. We next formulate taxonomy adaptation as an optimization problem to find the taxonomy that best fits the data. We then present a viable algorithm that can efficiently accomplish taxonomy adaptation. We conduct extensive experiments to evaluate our approach's efficacy for group profiling, compare the approach with some alternatives, and study its performance for dynamic group profiling. While pointing out various applications of taxonomy adaption, we suggest some future work that can take advantage of burgeoning Web 2.0 services for online targeted marketing, counterterrorism in connecting dots, and community tracking.
A Multi-objective Genetic Algorithm for Determining Facility Location of Solid Wastes
Authors: Geng Liu, Bo He, Chao Yang
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 04 (2007)

Reverse logistics for solid wastes has close relation with the environment. This paper develops a multi-objective mathematic model for design of the reverse logistics network for solid wastes. The objectives are defined to minimize both total cost of construction and negative impact on people produced by treatment facilities for solid wastes. Solving the model, the locations, numbers and capacities of treatment facilities and the allocation of waste generation sites to treatment facilities can be determined. So, a reverse logistics network can be designed. A multi-objective evolutionary algorithm employing the problem-specific heuristic knowledge is presented. The Pareto optimal solution set obtained by the algorithm is shown to be useful for the decision-maker. Finally, the model has been applied to a practical example in China.