ppxscal/embedding_network huggingface dataset:
Multiresolution geometric details on subdivision surfaces
Authors: Przemyslaw Musialski, Robert F. Tobler, Stefan Maierhofer, Charles A. Wüthrich
Venue: Proceedings of the 5th international conference on Computer graphics and interactive techniques in Australia and Southeast Asia (2007)

Subdivision surfaces are methods for creating smooth surfaces out of coarse polyhedral meshes. Due to their recursive nature they are ideally suited for adding geometric detail on different resolutions. When modeling real-world surfaces it is possible to extract the fine surface details from a material and apply these on dense meshes in the form of vertex displacements. Material characteristics are a mixture of features at different scales, which can be recovered by a frequency decomposition of an input height map. Applying these sub-bands as displacement in a recursive multiresolution fashion allows the ability to influence or mix details obtained from one or more sources. This paper presents a method for computing multiresolution displaced subdivision surfaces on the GPU that performs in real-time and provides an interactive control over the obtained results.
Are Two Heads Better than One? On the Effectiveness of Pair Programming
Authors: Tore Dybå, Erik Arisholm, Dag I. K. Sjøberg, Jo E. Hannay, Forrest Shull
Venue: IEEE Software (2007)

Pair programming has many claimed benefits over individual programming. Researchers examined all 15 existing studies of pair programming to determine whether working in pairs is more effective than working individually.
Towards Evaluation of Inferred Gene Network
Authors: S. Zainudin, S. Deris
Venue: Proceedings of the The 2007 International Conference Computational Science and its Applications (2007)

Gene network is a representation for gene interactions. A gene collaborates with other genes in order to function. Past researches have successfully inferred gene network from gene expression microarray data. Gene expression microarray data represent different levels of gene expressions for organisms during biological activity such as cell cycle. A framework for gene network inference is to normalize gene expression data, discretize data, learn gene network and evaluate gene interactions. This framework was used to learn the gene network for two S.cerevisiae gene expression datasets (Spellman Cell cycle and Gasch Yeast Stress). Gene interaction inference was also done on data contained in 8 major clusters found by Spellman. The inferred networks were compared to gene interaction data curated by Biogrid. Results from the comparison shows that some of the inferred gene interactions agree with data contained in Biogrid and by referring to curated genetic interactions in Biogrid, we can understand the significance of computationally inferred gene interactions.
Practical Priorities in System Testing
Authors: N. H. Petschenik
Venue: IEEE Software (1985)

During the system test phase, "thorough testing" can pass the limits of practicality. Test case selection, based on simple priority rules, is one solution to the problem of practicality vs. thoroughness.
Two algorithms for approximate construction of the set of positional absorption in the game problem of pursuit
Authors: D. K. Mikhalev, V. N. Ushakov
Venue: Automation and Remote Control (2007)

Consideration is given to the differential game on the finite period of time in which the first player has to guarantee that the phase point will entry the terminal set and the second one must ensure the evasion of the terminal set on this interval. Is proposed a method for approximate construction of the set of positional absorption, i.e, the set of all initial points for which the problem of pursuit posed for the first player is solvable. The method is based on unification constructions and structures close to them. Relations defining the system of sets that approximates the set of positional absorption are written out. The convergence of the approximating system to the set of positional absorption is proved.
An Analysis Framework for Mobile Workforce Automation
Authors: Volker Gruhn, Andre Kohler
Venue: Proceedings of the 11th IEEE International Enterprise Distributed Object Computing Conference (2007)

In this paper we introduce an analysis framework for mo- bile workforce automation. The framework is based on the findings from earlier research as well as on an analysis of 27 recent case studies conducted within the field of mobile workforce automation. It consists of a general reference process for mobile work and of a model explaining influ- encing factors (worker, task, coordination system, informa- tion system), optimization goals and their relationships in mobile business processes. The framework can be applied to process modeling, simulation, and optimization as well as to requirements analysis and return on investment cal- culations. Based on the results of case study evaluation, it is furthermore shown, that recent mobile IT solutions are mainly built for relatively simple processes and cooperation models. Mobilizing more complex processes still seems to be a challenge.
RST in Decision Tree Pruning
Authors: Jin-Mao Wei, Shu-Qin Wang, Jun-Ping You, Guo-Ying Wang
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 03 (2007)

Pruning decision trees is an effective way to overwhelm over-fitting in practice. Various pruning methods have been proposed in many literatures. Though these methods prune decision trees in the light of the principle of 'Minimum De- scription Length', they fail to explicitly take into account the impacts of tree scales in the pruning process. This paper proposes a simple decision tree pruning method based on RST (Rough Set Theory). Depth-fitting ratio is introduced for pruning a constructed decision tree, which involves both the depth and the explicit degrees of the sub-trees under evaluation. Experiments on some open data sets shows the feasibility of the new pruning method.
Relating the Evolution of Design Patterns and Crosscutting Concerns
Authors: Lerina Aversano, Luigi Cerulo, Massimiliano Di Penta
Venue: Proceedings of the Seventh IEEE International Working Conference on Source Code Analysis and Manipulation (2007)

Crosscutting concerns consist in software system features having the implementation spread across modules as tangled and scattered code. In many cases, these crosscutting concerns represent design pattern clients, i.e., invocations to pattern features. When a design pattern evolves, this can cause the addition or the change of scattered and tangled code, which contributes to the evolution of the crosscutting concern. This paper empirically analyzes the relationship between design pattern evolution and the changes in the induced crosscutting concerns. Specifically, the paper investigates to what extent the crosscutting concern co-changes with the pattern, whether there is a relationship between the type of change and the induced crosscutting change, and whether different patterns induce different amount of crosscutting. The paper reports results from the analysis of Tomcat and JHotDraw evolution.
Session IV Impact of Structured Programming on Evolving Technologies and Related Programming Disciplines
Authors: G. de Balbine
Venue: Computer (1975)

The last session of the 1974 Lake Arrowhead Workshop was oriented towards the future of structured programming. Inasmuch as discussions in the preceding sessions had focused on current achievements (and sometimes failures), we tried in the concluding session to offer some answers to the question: Where do we go from here? The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Collective Wisdom: A Modest Proposal to Improve Peer Review, Part 1
Authors: Fred Douglis
Venue: IEEE Internet Computing (2007)

Not all authors appreciate the rules for overlapping manuscript submissions, but we might be able to improve the process for the future.
An Adaptive Image Enhancement Based on the Vector Closed Operations
Authors: Hu Yefeng, Li Bo, Zheng Jin, Yu Bai
Venue: Proceedings of the Fourth International Conference on Image and Graphics (2007)

This paper presents an adaptive image enhancement algorithm based on the vector closed operations, aiming at distinguishing features from impulse noise and salt & pepper noise, and solving the problem of the inconvenience in interactively modifying the parameter to adjust the contrast. According to the characteristic that grey level values arising from noise are normally weakly correlated and those arising from features are strongly correlated, the proposed algorithm can distinguish features from noise in each scale using correlation values, and then they can be adaptively processed independently. Therefore, the algorithm can adaptively enhance more features and suppress more noise. Meanwhile it can adaptively adjust the contrast based on the visual statistics theory. After the contrast is adjusted, the mean value of the enhanced image is around the gray of the visually optimized image. Therefore, the finally enhanced image has good sharpening features with noise suppressed and contrast moderately enhanced.
An Experimental Evaluation of the Effectiveness and Efficiency of the Test Driven Development
Authors: Atul Gupta, Pankaj Jalote
Venue: Proceedings of the First International Symposium on Empirical Software Engineering and Measurement (2007)

Test Driven Development (TDD) is an approach for developing programs incrementally by first writing tests and then writing enough code to satisfy them. Though there have been some experiments for evaluating TDD on smaller scope, its impact on a larger scope of program development activities needs to be investigated. In this work, we evaluate the impact of TDD on various program development activities like designing, coding, and testing, through a controlled experiment where we compare it with the conventional way of developing the code. In a single-factor block design, two groups of students developed two moderately sized programs following the two development-styles under study. Our results suggest that TDD helps in reducing overall development effort and improving developer's productivity whereas the code quality seems to be affected by the actual testing efforts applied during a development-style.
Analysis of the Terminal Behavior of Some Classes of Iterative Arrays of Linear Machines
Authors: Ming-Kuei Hu
Venue: IEEE Transactions on Computers (1972)

General methods are presented for analyzing the terminal behavior of the classes of one-dimensional unidirectional iterative systems with arbitrary many intercell leads and two-dimensional iterative systems with unidirectional signal flow and one intercell lead on each axis, where the cell structure is either an arbitrary linear switching circuit (combinational) or an arbitrary linear sequential machine (LSM).
Peer-to-peer similarity search in metric spaces
Authors: Christos Doulkeridis, Akrivi Vlachou, Yannis Kotidis, Michalis Vazirgiannis
Venue: Proceedings of the 33rd international conference on Very large data bases (2007)

This paper addresses the efficient processing of similarity queries in metric spaces, where data is horizontally distributed across a P2P network. The proposed approach does not rely on arbitrary data movement, hence each peer joining the network autonomously stores its own data. We present SIMPEER, a novel framework that dynamically clusters peer data, in order to build distributed routing information at super-peer level. SIMPEER allows the evaluation of range and nearest neighbor queries in a distributed manner that reduces communication cost, network latency, bandwidth consumption and computational overhead at each individual peer. SIMPEER utilizes a set of distributed statistics and guarantees that all similar objects to the query are retrieved, without necessarily flooding the network during query processing. The statistics are employed for estimating an adequate query radius for k-nearest neighbor queries, and transform the query to a range query. Our experimental evaluation employs both real-world and synthetic data collections, and our results show that SIMPEER performs efficiently, even in the case of high degree of distribution.
Service Orientation in the Enterprise
Authors: Jan Bosch, Stefan Friedrichs, Stefan Jung, Johannes Helbig, Alexander Scherdin
Venue: Computer (2007)

Three short contributions address the needs, solutions, and effects of service orientation in applications as diverse as mobile telecommunications, e-government, and logistics. "Toward Mobile Services: Three Approaches"--For most companies, software products are considerably more valuable if integrated into a product suite from which each customer can pick and choose a unique configuration. Similarly, in an increasingly networked world, a company can greatly benefit from uniformly integrating its products with those of other companies in the same ecosystem. "New Paradigms for Next-Generation E-Government Projects"--Although the quality of management training is an important dimension of e-government success, three emerging IT trends are defining new rules for the public sector. These paradigms require next-generation e-government projects to shift the emphasis from building on proper technology to gaining a more profound understanding of the nature of organizational transformation and business process management. "Creating Business Value through Flexible IT Architecture"--In addition to mastering IT management, a flexible architecture is a key prerequisite for excellentIT delivery. In an evolutionary approach to architecture transformation, Deutsche Post developed a coordinated set of projects that implemented and reused business services, thus both creating business value and contributing to a flexible IT landscape.
Dynamic Risk Mitigation in Computing Infrastructures
Authors: R. Ann Miura-Ko, Nicholas Bambos
Venue: Proceedings of the Third International Symposium on Information Assurance and Security (2007)

In this brief paper, we formulate a novel analytical framework for modeling and mitigation of dynamically changing security risk profiles in information systems and networks. Risk accumulates at components/nodes (hosts, servers, databases, etc.) due to risk shocks hitting them (virus, worm attacks, etc.) and is monitored by risk indicators. The risk manager dynamically chooses defenses by reconfiguring and allocating available protection resources to various infrastructure components/nodes. The issue is to dynamically control risk by (re)deploying defenses on the spot in response to changing risk indicators. The framework is designed to parallel queuing modeling ones, mapping backlog/congestion to risk level/stress. This exposes interesting connections between dynamic risk management and queueing systems. It also allows for leveraging some results of congestion management for risk mitigation, as well as developing new ones to capture risk management performance tradeoffs.
Workshop Report Computer Packaging
Authors: J. W. Balde
Venue: Computer (1976)

On May 19-21, the Computer Packaging Committee of the IEEE Computer Society held its biennial workshop at Split Rock Lodge in the Poconos. Following the same format as in the past, the meeting featured a keynote speech and five technical sessions. Some 60 people from 14 states plus England and Japan were in attendance.
Software Science Revisited: A Critical Analysis of the Theory and Its Empirical Support
Authors: V. Y. Shen
Venue: IEEE Transactions on Software Engineering (1983)

The theory of software science was developed by the late M. H. Halstead of Purdue University during the early 1970's. It was first presented in unified form in the monograph Elements of Software Science published by Elsevier North-Holland in 1977. Since it claimed to apply scientific methods to the very complex and important problem of software production, and since experimental evidence supplied by Halstead and others seemed to support the theory, it drew widespread attention from the computer science community.
Modeling a Multiprocessor Architecture
Authors: J. R. Menand
Venue: IEEE Transactions on Software Engineering (1983)

Instead of using a very expensive and powerful central processing unit, the Hypercube F8 uses independent parallel microprocessors that are slow and inexpensive. This architecture is modeled in order to determine the proper number of microprocessors and to validate the system. The model is hierarchical. Different levels of the model are considered. Each level model corresponds to a subsystem of the Hypercube F8. Most of the common analytical methods are used and direct calculations are made. For each level several methods are compared and the approximations validated. The level 1 direct method is a general solution of polling models. The global model gives the throughput of the system the utilizations of the processors and the service times. We discuss the values of the parameters of the system.
Integration of neural networks in a geographical information system for the monitoring of a catchment area
Authors: Frédérik Thiery, Stéphane Grieu, Adama Traoré, Mathieu Barreau, Monique Polit
Venue: Mathematics and Computers in Simulation (2008)

The present work takes part in a global development of reliable and robust tools allowing real-time controlling and supervising of the Tet catchment area, the main river of the Pyrenees-Orientales department (Southern France). The impact of the Tet on the department life is significant and the management of its water quality must be largely improved and better supervised. The main purpose of the work was to develop ''rain flow'' predictive models, using Elman recurrent neural networks and based on the identification of localized rain events. These neural models allow understanding the dynamic evolution, according to rain events, of the Tet flow at a selected point and of the Perpignan WWTP (WasteWater Treatment Plant) influent flow. Their most interesting characteristic is their capability to predict big increases in river flow and in plant influent flow. The neural models have been integrated as thematic layers in a geographical information system (GIS) allowing an efficient management and update of the records used to develop the models.
Geospatial data qualities as web services performance metrics
Authors: Ganesh Subbiah, Ashraful Alam, Latifur Khan, Bhavani Thuraisingham
Venue: Proceedings of the 15th annual ACM international symposium on Advances in geographic information systems (2007)

Service discovery is the crucial phase in the emerging Geospatial Semantic Web to select functionally similar services for the user query. Quality of Service (QoS) based service discovery, popularly studied in traditional Web Services, applies also to Geospatial Web Services. QoS allows service clients to fine-tune their search according to their specific needs and criteria. In high-performance service-based geospatial applications, it becomes an interesting research challenge to identify geospatial parameters to further improve the search process. In this paper we have proposed a set of geospatial criteria that can be used alongside the regular QoS parameters in service discovery and invocation. We show that using this novel approach of incorporating domain-specific drill-down information in addition to the commonly used QoS parameters yield more accurate and trustable Web services platform. We use the proposed geospatial parameters as performance metrics in the experimental evaluation of our application. The parameters reflect geospatial data quality attributes already standardized and well-studied in geospatial literature.
Applying Secure Data Aggregation techniques for a Structure and Density Independent Group Based Key Management Protocol
Authors: Kashif Kifayat, Madjid Merabti, Qi Shi, David Llewellyn-Jones
Venue: Proceedings of the Third International Symposium on Information Assurance and Security (2007)

In many applications of Wireless Sensor Networks a Sink is interested in aggregated data instead of exact values from all sensors. To send aggregated data, it is also helpful to reduce the amount of data to be transmitted and thereby conserve energy. Indeed current in-network aggregation schemes are helpful to conserve energy but they are designed without considering possible security issues related to data privacy. Often we find wireless sensor networks designed with neighbouring nodes sharing keys or with decryption at aggregator nodes. In either situation the potential for aggregator nodes to be physically compromised means data privacy is at high risk. Therefore secure data aggregation is desirable where data can be aggregated without the need for decryption at aggregator nodes. Aggregation becomes especially challenging if end-to-end privacy between a source and a destination (sink or group leader) is required. In this paper we extend our Structure and Density Independent Group Based Key Management Protocol with the additional feature of secure data aggregation to provide better data privacy to every single node in a large scale Wireless Sensor Network.
How stable are large superpeer networks against attack?
Authors: Bivas Mitra, Sujoy Ghose, Niloy Ganguly
Venue: Proceedings of the Seventh IEEE International Conference on Peer-to-Peer Computing (2007)

In this paper, we analyze the stability of large scale superpeer networks against attack. Two different kinds of attacks namely deterministic and degree dependent attack have been introduced. We model the superpeer networks with the help of bimodal degree distribution and different attacks with the help of graph dynamics. It is interesting to observe from both theoretical and simulation results that peer degree plays the key role for maintaining stability of the superpeer networks in face of these two attacks.
Barriers to e-commerce and competitive business models in developing countries: A case study
Authors: Nir Kshetri
Venue: Electronic Commerce Research and Applications (2007)

This paper integrates and extends research on e-commerce in the developing world. We use three categories of feedback systems-economic, sociopolitical and cognitive-to offer a simple model of e-commerce barriers in the developing world. We also examine characteristics of e-business models that can be successfully employed in developing countries. Then, we provide the case of an e-business model followed by a Nepal-based multiple international award winning online provider. This paper's theoretical contribution is to explain the 'hows' and 'whys' of e-commerce in developing countries and to identify clear contexts and attendant mechanism.