ppxscal/embedding_network huggingface dataset:
A Picture-Building System
Authors: R. Williams
Venue: IEEE Transactions on Software Engineering (1976)

The picture-building system (PBS) deals with the problem of creating and manipulating data structures for applications using computer graphics. PBS has a data definition facility that enables one to specify structures needed for a given application, a manipulation facility for loading and editing the data, and displaying the image stored in the structures. The structures are defined in a relational data base and allow graphical attributes to be specified in the same way as nongraphical attributes. There is a deliberate attempt to separate data from programs which is in accord with other data-base developments. It is also possible to mix text and vector data with raster scan data which we have found to be very useful in some graphical applications. Some examples and a brief description of our color display system will be given.
White Box Pairwise Test Case Generation
Authors: Jangbok Kim, Kyunghee Choi, Daniel M. Hoffman, Gihyun Jung
Venue: Proceedings of the Seventh International Conference on Quality Software (2007)

Pairwise testing is an intuitive approach to test case generation, and has already seen use in commercial tools and practical applications. Pairwise testing is black box, in the sense that the test selection is independent of the internal structure of the system. We present a white box extension which selects additional test cases for the system based on specifications for one or more internal sub- operations. We have developed a novel algorithm for generating test cases for the full system which achieve pairwise coverage of the sub-operations. We have evaluated the algorithm using a case study, which indicates the practicality and effectiveness of the approach.
Hypothesis testing with incomplete relevance judgments
Authors: Ben Carterette, Mark D. Smucker
Venue: Proceedings of the sixteenth ACM conference on Conference on information and knowledge management (2007)

Information retrieval experimentation generally proceeds in a cycle of development, evaluation, and hypothesis testing. Ideally, the evaluation and testing phases should be short and easy, so as to maximize the amount of time spent in development. There has been recent work on reducing the amount of assessor effort needed to evaluate retrieval systems, but it has not, for the most part, investigated the effects of these methods on tests of significance. In this work, we explore in detail the effects of reduced sets of judgments on the sign test. We demonstrate both analytically and empirically the relationship between the power of the test, the number of topics evaluated, and the number of judgments available. Using these relationships, we can determine the number of topics and judgments needed for the least-cost but highest-confidence significance evaluation. Specifically, testing pairwise significance over 192 topics with fewer than 5 judgments for each is as good as testing significance over 25 topics with an average of 166 judgments for each - 85% less effort producing no additional errors.
A Numerical Prediction Product FNN Prediction Model Based on Condition Number and Analog Deviation
Authors: Long Jin, Xvming Shi
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 02 (2007)

Aiming at the problem that the fuzzy neural network (FNN) technique itself does not provide the input matrix to the FNN prediction model, we present a prediction modeling methodology which combines the computation and analysis of condition number with FNN, and design the computation and analysis of analog deviation for the input matrix to choose samples close correlated with predictand as training samples, thus effectively reducing the scale of network and evidently enhancing the prediction ability of the FNN prediction model. Using the same CMA T213 and Japanese numerical prediction product (NPP) data, we performed the contrast experiments and analyses of the FNN prediction model for daily regional mean precipitation based on condition number and analog deviation against the condition number-FNN prediction model and the traditional stepwise regression prediction model, and results show that under the condition of the same number of selected predictors, the prediction accuracy of the FNN prediction model based on condition number and analog deviation is 12.6% higher than that of the stepwise regression model in the experiment of independent samples of 49 days.
Exploiting X.509 Certificate and Multi-agent System Architecture for Role-Based Access Control and Authentication Management
Authors: Somchart Fugkeaw, Piyawit Manpanpanich, Sekpon Juntapremjitt
Venue: Proceedings of the 7th IEEE International Conference on Computer and Information Technology (2007)

This paper proposes the design of multi-user authentication in the multi-application based environment and Role-based Access Control by using PKI Authentication and X.509 Privilege Management Infrastructure (PMI). A binding model of RBAC authorization based on attribute certificate (AC) and public key certificate (PKC) is presented. Especially, the way of attribute mapping between PKC, Bridge AC, and Role AC is illustrated. In addition, the activity-based policy enforcement is introduced to make the system respond to malicious activities more appropriately. At a core, the multi agent system approach is applied to automate the flexible and effective management of user authentication, role delegation as well as system accountability. Finally, we reported our ongoing implementation status and demonstrated that our proposed model is a potential solution to support strong authentication and dynamic authorization in the multi-user and multi-application environment.
Major Issues in Software Engineering Project Management
Authors: R. H. Thayer
Venue: IEEE Transactions on Software Engineering (1981)

Software engineering project management (SEPM) has been the focus of much recent attention because of the enormous penalties incurred during software development and maintenance resulting from poor management. To date there has been no comprehensive study performed to determine the most significant problems of SEPM, their relative importance, or the research directions necessary to solve them. We conducted a major survey of individuals from all areas of the computer field to determine the general consensus on SEPM problems. Twenty hypothesized problems were submitted to several hundred individuals for their opinions. The 294 respondents validated most of these propositions. None of the propositions was rejected by the respondents as unimportant. A number of research directions were indicated by the respondents which, if followed, the respondents believed would lead to solutions for these problems.
The Use of Simulation in the Evaluaton of Software
Authors: N. F. Schneidewind
Venue: Computer (1977)

Two particularly nagging ailments faced by the computer industry today are the high cost and late delivery of software.1,2The symptoms usually surface during software debugging, testing, and integration; but the ailments themselves can most often be traced back to the program design phase and the structural characteristics of the program. The significance of program structural characteristics has been recognized for some time, as witnessed by the emergence of structured programming,3,4,a methodology that sets out to (1) reduce programming errors; (2) design an understandable, readable, and therefore maintainable program; (3) increase our ability to detect errors; and (4) prove, if only informally, that the program is correct. But there is another tool available that has usually been overlooked in the software development process: simulation.
An Improved Image Encryption Algorithm Based on Chaotic Maps
Authors: Chong Fu, Zhen-chuan Zhang, Ying-yu Cao
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 03 (2007)

This paper proposes a 3-D Lorenz system based image encryption scheme, which improves the security and performance of the encryption system over conventional one dimension chaos based ones. The balance and correlation properties of the analog sequences generated by Lorenz system are analyzed and a pre-process method is proposed, which makes the key stream have good statistical properties. Three initial parameters of Lorenz system are combined together as one key, which greatly enlarges the key space under precision restricted condition. The encryption speed is also improved since the position permutation and grayscale substitution of a pixel can be done by one iteration operation. Besides, the encryption system is strong against adaptive parameter synchronous attack since it has more complicated structure than one dimension ones. The experimental results indicate that the algorithm is more secure and efficient than conventional ones.
Write-optimized B-trees
Authors: Goetz Graefe
Venue: Proceedings of the Thirtieth international conference on Very large data bases - Volume 30 (2004)

Large writes are beneficial both on individual disks and on disk arrays, e.g., RAID-5. The presented design enables large writes of internal B-tree nodes and leaves. It supports both in-place updates and large append-only ("log-structured") write operations within the same storage volume, within the same B-tree, and even at the same time. The essence of the proposal is to make page migration inexpensive, to migrate pages while writing them, and to make such migration optional rather than mandatory as in log-structured file systems. The inexpensive page migration also aids traditional defragmentation as well as consolidation of free space needed for future large writes. These advantages are achieved with a very limited modification to conventional B-trees that also simplifies other B-tree operations, e.g., key range locking and compression. Prior proposals and prototypes implemented transacted B-tree on top of log-structured file systems and added transaction support to log-structured file systems. Instead, the presented design adds techniques and performance characteristics of log-structured file systems to traditional B-trees and their standard transaction support, notably without adding a layer of indirection for locating B-tree nodes on disk. The result retains fine-granularity locking, full transactional ACID guarantees, fast search performance, etc. expected of a modern B-tree implementation, yet adds efficient transacted page relocation and large, high-bandwidth writes.
Theoretical and Empirical Studies of Program Testing
Authors: W. E. Howden
Venue: IEEE Transactions on Software Engineering (1978)

Two approaches to the study of program testing are described. One approach is theoretical and the other empirical. In the theoretical approach situations are characterized in which it is possible to use testing to formally prove the correctness of programs or the correctness of properties of programs. In the empirical approach statistics are collected which record the frequency with which different testing strategies reveal the errors in a collection of programs. A summary of the results of two research projects which investigated these approaches are presented. The differences between the two approaches are discussed and their relative advantages and disadvantages are compared.
Microsystems Standards for the Personal Computing Network
Authors: J. Isaak
Venue: Computer (1978)

De facto standards will not be adequate to allow widespread communication among personal computing systems. Here is a look at the issues and the possibilities. 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
A novel ID-based designated verifier signature scheme
Authors: Jianhong Zhang, Jane Mao
Venue: Information Sciences: an International Journal (2008)

In a designated verifier signature scheme, only the designated verifier can verify the validity of a signature. This paper studies an Identity-based Strong Designated Verifier Signature (IBSDVS) scheme based on bilinear pairings by combining ID-based cryptosystem with the designated verifier signature scheme. We analyze the security of the scheme and the result shows that the security of our proposed scheme is closely related to the Bilinear Diffie-Hellman problem and the scheme is against delegatability attack.
Distribution Metric Driven Adaptive Random Testing
Authors: Tsong Yueh Chen, Fei-Ching Kuo, Huai Liu
Venue: Proceedings of the Seventh International Conference on Quality Software (2007)

Adaptive Random Testing (ART) was developed to enhance the failure detection capability of Random Testing. The basic principle of ART is to enforce ran- dom test cases evenly spread inside the input domain. Various distribution metrics have been used to measure different aspects of the evenness of test case distribu- tion. As expected, it has been observed that the fail- ure detection capability of an ART algorithm is related to how evenly test cases are distributed. Motivated by such an observation, we propose a new family of ART algorithms, namely distribution metric driven ART, in which, distribution metrics are key drivers for evenly spreading test cases inside ART. Out study uncovers several interesting results and shows that the new al- gorithms can spread test cases more evenly, and also have better failure detection capabilities.
Note: The Shields-Harary numbers of Km,n for continuous concave cost functions vanishing at 1
Authors: John Holliday, Peter Johnson
Venue: Discrete Applied Mathematics (2008)

It is shown that the Shields-Harary index of vulnerability of the complete bipartite graph K"m","n, with respect to the cost function f(x)=1-x, 0==m+2m, and 1n+1@?(n+m)^24@?, if m==m+2m, and between 1n+1@?(n+m)^24@?f(0) and mf(0), if m=
Assessing and Improving the Quality of Document Images Acquired with Portable Digital Cameras
Authors: R. Lins, G. P. e. Silva, Andre Ricardson Gomes e Silva
Venue: Proceedings of the Ninth International Conference on Document Analysis and Recognition - Volume 02 (2007)

Professionals and students of many different areas start to use portable digital cameras to take photos of documents, instead of photocopying them. This article analyses the quality of such documents for Optical Character Recognition and proposes ways of improving their transcription and readability.
Fast and Practical Algorithms for Planted (l, d) Motif Search
Authors: Jaime Davila, Sudha Balla, Sanguthevar Rajasekaran
Venue: IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB) (2007)

We consider the planted (l, d) motif search problem, which consists of finding a substring of length l that occurs in a set of input sequences {s1, . . . , sn} with up to d errors, a problem that arises from the need to find transcription factor-binding sites in genomic information. We propose a sequence of practical algorithms, which start based on the ideas considered in PMS1. These algorithms are exact, have little space requirements, and are able to tackle challenging instances with bigger d, taking less time in the instances reported solved by exact algorithms. In particular, one of the proposed algorithms, PMSprune, is able to solve the challenging instances, such as (17, 6) and (19, 7), which were not previously reported as solved in the literature.
Detection of nanoscale etch and ash damage to nanoporous methyl silsesquioxane using electrostatic force microscopy
Authors: Todd Gross, Shaoning Yao, Sri Satyanarayana
Venue: Microelectronic Engineering (2008)

We have used electrostatic force microscopy (EFM) to detect nanoscale dielectric constant variations resulting from damascene processing of blanket and patterned films of nanoporous methyl silsesquioxane (MSQ) (k=2.2). Ash processing can cause significant degradation of the dielectric constant for both blanket and patterned MSQ films if the film is exposed to moisture. We have observed that this degradation is reversible because the apparent dielectric constant of the ashed film is nearly the same as the as-deposited film if the film is baked at 80-150^oC. Reactive ion etching (RIE) causes ~100nm deep side wall damage in patterned samples as well as leaving a redeposited layer that has a higher dielectric constant. We also present some initial results that show the strength of the EFM signal is humidity dependent.
Game sketching
Authors: Michael Agustin, Gina Chuang, Albith Delgado, Anthony Ortega, Josh Seaver, John W. Buchanan
Venue: Proceedings of the 2nd international conference on Digital interactive media in entertainment and arts (2007)

Every project in any aspect of the creative industry must start with an ideation process. The essence of this process is to allow rapid exploration of ideas with very little resource expenditure. For ideation to be successful an idea must be explorable in hours if not minutes. The tools that are used should be readily accessible to designers in the field. The video game industry is a production oriented industry and thus the majority of the technology in this industry has focused on production tools. Very little attention has been paid to the ideation stage in the game industry. In this paper we explore the cultural and technical reasons for this lack of focus on ideation within the video game industry. We introduce the concept of game sketching. Game sketching is not a technology, rather it is a set of technologies and methodologies intended to encourage exploration at a very early stage. We present an overview of one tool we have developed and then discuss our users' experiences. We finish the paper with a set of examples of game sketching. In particular we include two examples of a game sketch where our technology was not used at all. The intention of this paper is to introduce the concept of game sketching, and in so doing to get people to ask questions early in the ideation stage.
An Efficient Resource Reservation and QoS Provisioning Mechanism Based on mSCTP for Next Generation Network
Authors: Byoung-Ho Ahn, Dae-Young Kim, Kuk-Hyun Cho, Si-Ho Cha, Minho Jo
Venue: Proceedings of the 5th ACIS International Conference on Software Engineering Research, Management & Applications (2007)

The next generation network (NGN) must provide mobility and multiple interfaces to enable the seamless delivery of packets, in IP mobility environments, with the best possible quality of service (QoS) guarantee. This paper proposes an efficient resource reservation and QoS provisioning mechanism based on mobile SCTP (mSCTP) with network mobility and multi-homing for NGN. To do this, the proposed mechanism does not refresh the reserved resources on the common path through the path management at the time of mSCTP-based handover. The path management is accomplished by maintaining the common path and common routers on the path. To show the validity of the proposed mechanisms, the ns-2 simulator was used. it can provide the end-to-end seamless QoS and resources management in IP mobility environments more efficiently.
Toward microbenchmarking XQuery
Authors: Philippe Michiels, Ioana Manolescu, Cédric Miachon
Venue: Information Systems (2008)

A substantial part of the database research field focusses on optimizing XQuery evaluation. However, there is a lack of tools allowing to easily compare different implementations of isolated language features. This implies that there is no overview of which engines perform best at certain XQuery aspects, which in turn makes it hard to pick a reference platform for an objective comparison. This paper is the first to give an overview of a large subset of the open source XQuery implementations in terms of performance. Several specific XQuery features are tested for each engine on the same hardware to give an impression of the strengths and weaknesses of that implementation. This paper aims at guiding implementors in benchmarking and improving their products.
From the Horse's Mouth
Authors: Neil Maiden, Ian Alexander
Venue: IEEE Software (2007)

In this column, IEEE Software aims to bring you the latest in requirements thinking. Since Richard Wexelblat's pioneering 1976 paper, "Maxims for Malfeasant Designers," it's been clear that specification can be done well or poorly. More recently, Norman Ramsey has followed Wexelblat's lead with "Maxims for Malfeasant Speakers," with advice such as "Remember that form is more important than content: Make sure your visuals conform to corporate standards, even if they don't say anything of consequence." Similarly, Peter J. Brown's paper, "13 Deadly Sins of Compiler Writing," includes the memorable "The first deadly sin is to code before you think." That sin is certainly as prevalent today as ever it was. So, this column has scoured the planet for great minds on the latest in requirements. We're proud to bring you a tongue-in-cheek "interview" with industry guru Colin Codephirst.
Improving Static Task Scheduling in Heterogeneous and Homogeneous Computing Systems
Authors: Chih-Hsueh Yang, PeiZong Lee, Yeh-Ching Chung
Venue: Proceedings of the 2007 International Conference on Parallel Processing (2007)

In this paper, we present a heuristic algorithm that improves the performance of static task scheduling. Our algorithm is based on the list-scheduling mechanism. For the listing phase, we use existing techniques to generate partial-order task sequences based on critical-path-first ordering, critical-task-first ordering, and their hybrids. For the scheduling phase, we propose a task-duplication algorithm with a look-ahead technique, so that the complexity of the new algorithm does not increase. The experiment results show that our algorithm outperforms other algorithms for any feasible task sequences with respect to the average execution times and the average scheduling length ratios.
Organization of CMS benchmarks in VDS Workflow on Virtual Machines
Authors: Lizhe Wang, Marcel Kunze
Venue: Proceedings of the Sixth International Conference on Grid and Cooperative Computing (2007)

Grid computing now becomes the de-facto standard for distributed computing and provides huge computing resources for high performance scientific & engineering applications. Recent advantages of virtual computing technologies make it possible to efficiently employ computing resources on-demand. Distributed virtual machines can help to build scalable, manageable and efficient Grid infrastructures. This paper is engaged to organize CMS applications in VDS workflows and execute them on virtual machines in computational Grids. The work is implemented on VMware virtual machines. Test results are discussed and the performance is evaluated with comparison of related work.
Performance of quasisynchronous scale time code division multiple access for AWGN channel
Authors: Ferkan Yılmaz, Oğuz Kucur
Venue: Computers and Electrical Engineering (2008)

We analyze bit error rate performance of a recently proposed multiple access system called scale time code division multiple access (STCDMA) for quasisynchronous communication over an AWGN channel. STCDMA depends on code, time and scale orthogonality introduced by spreading sequences and wavelets. Wavelets are employed as an orthogonal set of symbols for signaling, and their orthogonality over scale and time is exploited. The channel is partitioned into different scales, and each scale into different time slots. Each user is assigned a specific scale, time slot, and spreading code. Information symbols of each user are encoded by the Haar wavelet in its scale and time slot, and then they are spread by its spreading code. Complex-valued Hadamard sequences are used as spreading sequences and conventional detector (i.e. matched filter) is used at the receiver. Results show that the performance of STCDMA gets much better than that of CDMA over the quasisynchronous AWGN channel as the number of scales increases.