ppxscal/embedding_network huggingface dataset:
A weighted rough set based method developed for class imbalance learning
Authors: Jinfu Liu, Qinghua Hu, Daren Yu
Venue: Information Sciences: an International Journal (2008)

In this paper, we introduce weights into Pawlak rough set model to balance the class distribution of a data set and develop a weighted rough set based method to deal with the class imbalance problem. In order to develop the weighted rough set based method, we design first a weighted attribute reduction algorithm by introducing and extending Guiasu weighted entropy to measure the significance of an attribute, then a weighted rule extraction algorithm by introducing a weighted heuristic strategy into LEM2 algorithm, and finally a weighted decision algorithm by introducing several weighted factors to evaluate extracted rules. Furthermore, in order to estimate the performance of the developed method, we compare the weighted rough set based method with several popular methods used for class imbalance learning by conducting experiments with twenty UCI data sets. Comparative studies indicate that in terms of AUC and minority class accuracy, the weighted rough set based method is better than the re-sampling and filtering based methods, and is comparable to the decision tree and SVM based methods. It is therefore concluded that the weighted rough set based method is effective for class imbalance learning.
Understanding Success and Failure Profiles of ERP Requirements Engineering: an Empirical Study
Authors: Maya Daneva
Venue: Proceedings of the 33rd EUROMICRO Conference on Software Engineering and Advanced Applications (2007)

Organizations adopting Enterprise Resource Planning (ERP) are also adopting standard ERPvendor- specific process models for engineering their requirements. Making successfully a live process out of such a model is hard. Maturity assessment frameworks can help ERP adopters identify and understand those practices which help their ERP processes succeed and those which do not. This paper deploys a Requirements Engineering maturity model to examine variations in instantiations of a standard ERP RE process. We draw on our previous results and our lessons learnt from eight years of experience in using ERP RE processes.
Broué-Enguehard maps and Atkin-Lehner involutions
Authors: YoungJu Choie, Patrick Solé
Venue: European Journal of Combinatorics (2008)

Let @? be one of the ten integers such that the sum of their divisors divide 24. For each such @?, (except 15) we give a map from an algebra of polynomial invariants of some finite group to the algebra of modular forms invariant under the Atkin-Lehner group of level @?. These maps are motivated and inspired by constructions of modular lattices from self-dual codes over rings. This work generalizes Broue-Enguehard work in level one and three obtained from binary and ternary codes.
Time evolution of perturbed solitons of modified Kadomtsev-Petviashvili equations
Authors: Sarun Phibanchon, Michael A. Allen
Venue: Proceedings of the The 2007 International Conference Computational Science and its Applications (2007)

We solve the (2+1)-dimensional Schamel-Kadomtsev- Petviashvili equations with negative and positive dispersion numerically with one or two perturbed plane solitons as initial conditions. In the negative dispersion case, the plane soliton is stable and retains its identity. For the equation with positive dispersion, the plane solitons decay into twodimensional lump solitons. We show that in contrast to onedimensional solitons, collisions between two lump solitons are far from elastic. We also demonstrate that the solitons emerging from the collision can be very sensitive to the alignment of the solitons prior to collision.
On the Effectiveness of Flexible Deterministic Packet Marking for DDoS Defense
Authors: Yang Xiang, Wanlei Zhou, Zhongwen Li
Venue: Proceedings of the 2007 IFIP International Conference on Network and Parallel Computing Workshops (2007)

IP traceback is one of the defense mechanisms for Distributed Denial of Service (DDoS) attacks. However, most traceback schemes consume extensive resources such as CPU, memory, disk storage and bandwidth and require a large amount of IP packets to reconstruct sources, which makes them impractical and ineffective. In this paper, we present a new flexible IP traceback scheme called Flexible Deterministic Packet Marking (FDPM). The flexibilities of FDPM are in two ways, one is that it can adjust the length of marking field according to the network protocols deployed, thus it can work well even in an environment with different network protocols; the other is that it can adjust the marking rate according to the load of participating router, while it still can maintain the marking function. In order to verify the effectiveness of FDPM for DDoS defense in terms of marking efficiency, maximum forwarding rate, and number of packets for reconstruction, we tested FDPM by both simulation and Linux router implementation with an emphasis on the latter. The experiments demonstrate that the built-in overload prevention mechanism, flowbased marking, can isolate and mark the most possible DDoS attack packets, while keeping the load of the participating router in a reasonably low degree. The real hardware implementation confirms that this flexible capability is important when traceback mechanisms are used in a real DDoS defense scenario.
Optimum Sensing Technique and Approach for Low Power Consumption Network
Authors: Hamid Jabbar, Taewan Kim, Jin-Suk Kang, Jangho Lee, Hyosik Yang, Meeyoung Sung, Gyunleen Park, Taikyeong Jeong
Venue: Proceedings of the 5th ACIS International Conference on Software Engineering Research, Management & Applications (2007)

This paper presents a technique to integrate energy efficient ubiquitous sensors to work in a network for optimum control. This optimization technique can reduce power consumption by using wireless communicating sensors with a supervisor control. This supervisory control of the sensors gives it an advantage of being controllable from any embedded, desktop or Internet platform. Sensors for different purposes can work together to form a network which can be implemented in many environment like homes, city, hospitals and remote locations like mountains, forests etc. We employed an optimized sensing system and algorithm which reduced the number of sensors and power consumption.
Design of Totally Self-Checking Check Circuits for m-Out-of-n Codes
Authors: D. A. Anderson
Venue: IEEE Transactions on Computers (1973)

The design of totally self-checking check circuits for m-out-of-n codes is described. Totally self-checking m-out-of-n checkers provide an error indication whenever the input is not an m-out-of-n code or whenever a fault occurs within the checker itself. Since the checker checks itself, there is no need for additional maintenance access or periodic exercise of the checker to verify its ability to detect errors. The basic structure of the checker relies on the use of majority detection circuits. Various gate level implementations for the majority detection circuits are also presented, although the self-checking capability of the checker does not depend on their particular implementation since they are exhaustively tested by code inputs. The self-testing checkers for k-out-of-2k codes are discussed in the most detail since the totally self-checking checkers for 1-out-of-n and arbitrary m-out-of-n codes are constructed by first translating the code to a k-out-of-2k code via a totally self-checking translator.
A trusted mobile phone reference architecturevia secure kernel
Authors: Xinwen Zhang, Onur Acıiçmez, Jean-Pierre Seifert
Venue: Proceedings of the 2007 ACM workshop on Scalable trusted computing (2007)

Driven by the ever increasing information security demands in mobile devices, the Trusted Computing Group (TCG) formed a dedicated group - Mobile Phone Working Group (MPWG). to address the security needs of mobile platforms. Along this direction, the MPWG has recently released a Trusted Mobile Phone Reference Architecture Specification. In order to realize trusted mobile platforms, they adapt well-known concepts like TPM, isolation, integrity measurement, etc. from the trusted PC world - with slight modifications due to the characteristics and resource limitations of mobile devices - into generic mobile phone platforms. The business needs of mobile phone industry mandate 4 different stakeholders(platform owners): device manufacturer, cellular service provider, general service provider, and of course the end-user. The specification requires separate trusted and isolated operational domains, so called Trusted Engines, for each of these stakeholders. Although the TCG MPWG does not explicitly prescribe a specific technical realization of these Trusted Engines, a general perception suggests reusing the very well established (Trusted) Virtualization concept from corresponding PC architectures. However, despite of all its merits, the current "resource devourer" Virtualization is not very well suited for mobile devices. Thus, in this paper, we propose another isolation technique, which is specifically crafted for mobile phone platforms and respects its resource limitations. We achieve this goal by realizing the TCG's Trusted Mobile Phone specification by leveraging SELinux which provides a generic domain isolation concept at the kernel level. Additional to harnessing the potential of SELinux to realize mobile phone specific (isolated) operational domains, we are also able to seamlessly integrate the important integrity measurement and verification concept into our SELinux-based Trusted Mobile Phone architecture. This is achieved by defining some SELinux policy language extensions. Thus, the present paper provides a novel, efficient and inherently secure TCG-aware Mobile Phone reference architecture
Test Cases Generation from UML Activity Diagrams
Authors: Hyungchoul Kim, Sungwon Kang, Jongmoon Baik, Inyoung Ko
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 03 (2007)

UML activity diagram is a notation suitable for modeling a concurrent system in which multiple objects interact with each other. This paper proposes a method to generate test cases from UML activity diagrams that minimizes the number of test cases generated while deriving all practically useful test cases. Our method first builds an I/O explicit Activity Diagram from an ordinary UML activity diagram and then transforms it to a directed graph, from which test cases for the initial activity diagram are derived. This conversion is performed based on the single stimulus principle, which helps avoid the state explosion problem in test generation for a concurrent system.
Taguchi Larger-the-Best Software Quality Metrics
Authors: Kiumi Akingbehin
Venue: Proceedings of the 5th ACIS International Conference on Software Engineering Research, Management & Applications (2007)

A set of metrics (numerical software measurements) based on the Taguchi philosophy have been proposed for measuring software quality. The Taguchi approach, originally developed for manufacturing processes, defines quality in terms of "loss imparted to society" by a product after delivery of the product to the end user. The nominal-the-best and smaller-the-best loss functions developed by Taguchi have been adapted for software products and case studies have been presented to illustrate the adaptation. This paper adapts the Taguchi larger-the-best loss function to software quality metrics like Mean Time Between Failure (MTBF). Software metrics like MTBF have a desired (target) value of infinity and therefore should be as large as possible. A value of infinity however is not easy to work with, and poses several challenges. An elegant solution is proposed in this paper. The solution uses the reciprocal of infinity (that is, zero) and the applicable Taguchi loss functions are modified to use reciprocal parameters.
DTLSR: delay tolerant routing for developing regions
Authors: Michael Demmer, Kevin Fall
Venue: Proceedings of the 2007 workshop on Networked systems for developing regions (2007)

We consider the problem of routing in delay tolerant networks deployed in developing regions. Although these environments experience intermittent connectivity (hence the desire to use DTN), in many cases the topology has an underlying stability that we can exploit when designing routing protocols. By making small, yet critical, modifications to classical link state routing, we derive a more effective algorithm capable of leveraging predictions of future link uptimes. We describe a complete and fully-implemented protocol, capable of being deployed in the DTN reference implementation without modification. Using a simulation incorporating real-world network characteristics, we demonstrate that our system operates effectively when conventional routing and forwarding may fail.
Spatialization Design: Comparing Points and Landscapes
Authors: Melanie Tory David Sprague Fuqu Wu Wing Yan So Tamara Munzner
Venue: IEEE Transactions on Visualization and Computer Graphics (2007)

Spatializations represent non-spatial data using a spatial layout similar to a map. We present an experiment comparing different visual representations of spatialized data, to determine which representations are best for a non-trivial search and point estimation task. Primarily, we compare point-based displays to 2D and 3D information landscapes. We also compare a colour (hue) scale to a grey (lightness) scale. For the task we studied, point-based spatializations were far superior to landscapes, and 2D landscapes were superior to 3D landscapes. Little or no benefit was found for redundantly encoding data using colour or greyscale combined with landscape height. 3D landscapes with no colour scale (height-only) were particularly slow and inaccurate. A colour scale was found to be better than a greyscale for all display types, but a greyscale was helpful compared to height-only. These results suggest that point-based spatializations should be chosen over landscape representations, at least for tasks involving only point data itself rather than derived information about the data space.
Design of a WCET-Aware C Compiler
Authors: H. Falk, P. Lokuciejewski
Venue: Proceedings of the 2006 IEEE/ACM/IFIP Workshop on Embedded Systems for Real Time Multimedia (2006)

This paper presents techniques to integrate worst-case execution time (WCET) data into a compiler. Currently, a tight integration of WCET into compilers is strongly desired, but only some ad-hoc approaches were reported currently. Previous work mainly used self-written WCET estimators with limited functionality and preciseness during compilation. A very tight integration of a high quality WCET analyzer into a compiler was not yet achieved. This work is the first to present such a tight coupling between a compiler and the WCET analyzer aiT. This is done by automatically translating the assembly-like contents of the compiler's low-level format (LLIR) to aiT's exchange format CRL2. Additionally, the results produced by aiT are automatically collected and re-imported into the compiler infrastructure. The work described in this paper is smoothly integrated into a C compiler for the Infineon TriCore processor. It opens up new possibilities for the design of WCET-aware optimizations in the future. The concepts for extending the compiler structure are kept very general so that they are not limited to WCET information. Rather, it is possible to use our concepts also for multi-objective optimization of e. g. best-case execution time (BCET) or energy dissipation
Special Report: Distributed Computer Processing in Europe
Authors: J. M. Boland
Venue: Computer (1976)

As minicomputers and microprocessors continue to drop in price, people at virtually any level in a company may soon be able to purchase their own computing hardware with little or no formal approval. While such a possibility is clear, the nature and extent of the resulting changes are hard to imagine. Will inhouse DP centers be left with only a handful of clients needing high-volume applications? What about the effect on mainframe suppliers, service bureaus, and timesharing companies? To what extent will data processing authority be decentralized? 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
Fault Detection of Oil Pump Based on Fuzzy Neural Network
Authors: Jingwen Tian, Meijuan Gao, Liting Cao, Kai Li
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 02 (2007)

Considering the issues that the relationship between the fault of oil pump existent and fault information is a complicated and nonlinear system, and it is very difficult to found the process model to describe it. The fuzzy neural network has the advantages of both fuzzy theory and neural network. In this paper, a fault detection method of oil pump based on fuzzy neural network is presented, moreover, we construct the structure of fuzzy neural network that used for the fault detection of oil pump, and adopt the Levenberg- Marquart optimizing algorithm to train fuzzy neural network. With the ability of strong self-learning and function approach of fuzzy neural network, the detection method can truly diagnosticate the fault of oil pump by learning the fault information of oil pump. The real detection results show that this method is feasible and effective.
An Analysis of "Distributed Free Space" in an Operating and Data Management Systems Environment
Authors: Y. H. Chin
Venue: IEEE Transactions on Software Engineering (1978)

Due to subsequent insertion and deletion, the performance of a file will decline as time goes by. In order to maintain a fast response time at the expense of storage space, a technique commonly known as "within distributed free space" has been developed and used in many access methods. In this paper, a procedure to determine and preallocate the size of "within distributed free space" is presented. The optimal block size for a data storage area, which minimizes the CPU operations and I/O interruptions, is also described.
Toolpack An Experimental Software Development Environment Research Project
Authors: L. J. Osterweil
Venue: IEEE Transactions on Software Engineering (1983)

This paper discusses the goals and methods of the Toolpack project and in this context discusses the architecture and design of the software system being produced as the focus of the project. Toolpack is presented as an experimental activity in which a large software tool environment is being created for the purpose of general distribution and then careful study and analysis. The paper begins by explaining the motivation for building integrated tool sets. It then proceeds to explain the basic requirements that an integrated system of tools must satisfy in order to be successful and to remain useful both in practice and as an experimental object. The paper then summarizes the tool capabilities that will be incorporated into the environment. It then goes on to present a careful description of the actual architecture of the Toolpack integrated tool system. Finally the Toolpack project experimental plan is presented, and future plans and directions are summarized.
An Effective Iterative Metamorphic Testing Algorithm Based on Program Path Analysis
Authors: Guowei Dong, Changhai Nie, Baowen Xu, Lulu Wang
Venue: Proceedings of the Seventh International Conference on Quality Software (2007)

Metamorphic testing(MT) is very practical and effective for programs with oracle problems, and many researches have been done in this field. In this article, we present a new iterative MT algorithm, APCEMSI, to avoid the blindness of existing MT methods. The test suites generated by APCEMSI satisfy a criterion which is defined upon program path analysis technique. Experiment result shows that APCEMSI could find errors effectively with much fewer test cases.
The Generation of Color Sequences for Univariate and Bivariate Mapping
Authors: Philip Robertson, John O'Callaghan
Venue: IEEE Computer Graphics and Applications (1986)

Recent technological advances have made it feasible to produce full color statistical maps on computer-controlled display systems. This has caused an appraisal of the use of color to represent statistical variables, and the development of a theoretical structure for the choice of suitable univariate and bivariate map coloring schemes. Realization of such schemes in an intuitive and controlled way is important to the comprehension of statistical variables from maps. Therefore, we present a method of generating specific color sequences within the framework of a uniform color space, allowing for the intuitive specification of color sequences and for their realization on various display systems.
Block variants of Hammarling's method for solving Lyapunov equations
Authors: Daniel Kressner
Venue: ACM Transactions on Mathematical Software (TOMS) (2008)

This article is concerned with the efficient numerical solution of the Lyapunov equation AT X &plus; XA &equls; &minus;C with a stable matrix A and a symmetric positive semidefinite matrix C of possibly small rank. We discuss the efficient implementation of Hammarling's method and propose among other algorithmic improvements a block variant, which is demonstrated to perform significantly better than existing implementations. An extension to the discrete-time Lyapunov equation ATXA &minus; X &equals; &minus;C is also described.
Analysis assistant for single-molecule force spectroscopy data on membrane proteins—MPTV
Authors: Frank Mueller, Daniel J. Muller, Dirk Labudde
Venue: Bioinformatics (2006)

Summary: Force-distance (F-D) curves of single membrane proteins reveal information on inter-and intramolecular interactions occurring within a protein and between proteins. However, the analysis of single-molecule force spectroscopy data is a time consuming and complex process requiring objective criteria. In most cases the user requires additional information to interpret F-D curves. Therefore we developed a software assistant representing the force or molecular interaction pattern and the topology or the 3D structure of the membrane protein. This representation establishes a basis for detailed interpretation of the protein structure and its underlying molecular interactions. Various integrated bioinformatic features further assist in the interpretation of measured and assigned molecular interactions that determine membrane protein folding, structure, stability and function. Web queries and programs about the topology are directly linked. Motifs, helix types, representation of Venn diagrams and the complete functionality of the program Jmol belong to it. Availability: The program MPTV is freely available from the website at Contact: dirk.labudde@biotec.tu.dresden.de