ppxscal/embedding_network huggingface dataset:
Generating Wizards for Initializing Software Components
Authors: Hironori Washizaki, Takao Adachi, Yoshiaki Fukazawa
Venue: Proceedings of the 7th IEEE International Conference on Computer and Information Technology (2007)

A software component often requires programmers to set appropriate initial values in many of its attributes. The work involved in the initialization can be alleviated by at- taching a wizard interface to the target component itself and setting the initial values visually from the wizard; however, there are large development costs associated with devising suitable initial value candidates and producing a new wiz- ard to use these initial values for each individual compo- nent. In this paper, we propose a system whereby appli- cation programs that use a target component are subjected to dynamic analysis to discover which attributes and initial values are set most often during the running of the compo- nent. The proposed system generates and attaches a wiz- ard, which supports application programmers to initialize the component visually by using these initial values, to the component. Experiments have shown that the attributes and their initial values chosen for initialization by gener- ated wizards closely resemble the expectations of the com- ponent's original developers.
On concurrent detection of errors in polynomial basis multiplication
Authors: Siavash Bayat-Sarmadi, M. Anwar Hasan
Venue: IEEE Transactions on Very Large Scale Integration (VLSI) Systems (2007)

The detection of errors in arithmetic operations is an important issue. This paper discusses the detection of multiple-bit errors due to faults in bit-serial and bit-parallel polynomial basis (PB) multipliers over binary extension fields. Our approach is based on multiple parity bits. Experimental results presented here show that due to an increase in the number of parity bits, the area overhead tends to increase linearly, but the probability of error detection approaches unity fairly quickly, e.g., for eight parity bits. In bit-serial implementation of a GF(2163) PB multiplier using eight parity bits, the area overhead and the probability of error detection are 10.29% and 0.996, respectively. This is achieved without any increase in the computation time of the GF(2163) PB multiplier.
Predictive DP Matching for On-Line Character Recognition
Authors: D. Baba, S. Uchida, H. Sakoe
Venue: Proceedings of the Ninth International Conference on Document Analysis and Recognition - Volume 02 (2007)

For on-line character recognition, predictive DP match- ing is proposed where two physically different features, co- ordinate features and directional features, are handled in a unified manner. For this unification, the distance of the directional features is converted into a distance of the co- ordinate features by a feature prediction technique. An ex- perimental result showed that the predictive DP matching could attain a recognition rate comparable to the rate by the conventional DP matching which requires the costly op- timization of the weight to balance the two features.
Efficient simulation of finite horizon problems in queueing and insurance risk
Authors: Leonardo Rojas-Nandayapa, Søren Asmussen
Venue: Queueing Systems: Theory and Applications (2007)

Let ¿(u,t) be the probability that the workload in an initially empty M/G/1 queue exceeds u at time t<¿, or, equivalently, the ruin probability in the classical Crámer-Lundberg model. Assuming service times/claim sizes to be subexponential, various Monte Carlo estimators for ¿(u,t) are suggested. A key idea behind the estimators is conditional Monte Carlo. Variance estimates are derived in the regularly varying case, the efficiencies are compared numerically and also the estimators are shown to have bounded relative error in some main cases. In part, also extensions to general Lévy processes are treated.
A case for cooperative and incentive-based federation of distributed clusters
Authors: Rajiv Ranjan, Aaron Harwood, Rajkumar Buyya
Venue: Future Generation Computer Systems (2008)

Research interest in Grid computing has grown significantly over the past five years. Management of distributed resources is one of the key issues in Grid computing. Central to management of resources is the effectiveness of resource allocation as it determines the overall utility of the system. The current approaches to brokering in a Grid environment are non-coordinated since application-level schedulers or brokers make scheduling decisions independently of the others in the system. Clearly, this can exacerbate the load sharing and utilization problems of distributed resources due to sub-optimal schedules that are likely to occur. To overcome these limitations, we propose a mechanism for coordinated sharing of distributed clusters based on computational economy. The resulting environment, called Grid-Federation, allows the transparent use of resources from the federation when local resources are insufficient to meet its users' requirements. The use of computational economy methodology in coordinating resource allocation not only facilitates the Quality of Service (QoS)-based scheduling, but also enhances utility delivered by resources. We show by simulation, while some users that are local to popular resources can experience higher cost and/or longer delays, the overall users' QoS demands across the federation are better met. Also, the federation's average case message-passing complexity is seen to be scalable, though some jobs in the system may lead to large numbers of messages before being scheduled.
Edge Detection in Simple Scenes Using a Priori Information
Authors: A. K. Griffith
Venue: IEEE Transactions on Computers (1973)

A system of programs is described for the detection of the straight edge lines in simple scenes. Distinct lines are detected by a procedure that is relatively inexpensive. The more subtle lines are then located by a search that is much more costly per unit area, but which is only applied to certain areas suggested by the locations of the lines already found. The considerable efficiency of this approach to edge detection is discussed both theoretically and in relation to the performance of the present system. The heuristics used in proposing possible subtle lines are described in detail. In addition, considerable attention is devoted to other aspects of the procedure such as: local edge-detection operators, vertex finding, and the extraction of lines from local evidence.
Modula and a Question of Time
Authors: J. E. Allchin
Venue: IEEE Transactions on Software Engineering (1980)

The programming language Modula is reviewed for its ability to support the wide variety of time usages required in a process control system. It is shown that in many instances concurrent languages supporting device control and multiprogramming may need additional facilities for the support of time.
A minimum description length objective function for groupwise non-rigid image registration
Authors: Stephen Marsland, Carole J. Twining, Chris J. Taylor
Venue: Image and Vision Computing (2008)

Non-rigid registration finds a dense correspondence between a pair of images, so that analogous structures in the two images are aligned. While this is sufficient for atlas comparisons, in order for registration to be an aid to diagnosis, registrations need to be performed on a set of images. In this paper, we describe an objective function that can be used for this groupwise registration. We view the problem of image registration as one of learning correspondences from a set of exemplar images (the registration set), and derive a minimum description length (MDL) objective function. We give a brief description of the MDL approach as applied to transmitting both single images and sets of images, and show that the concept of a reference image (which is central to defining a consistent correspondence across a set of images) appears naturally as a valid model choice in the MDL approach. In this paper, we demonstrate both rigid and non-rigid groupwise registration using our MDL objective function on two-dimensional T1 MR images of the human brain, and show that we obtain a sensible alignment. The extension to the multi-modal case is also discussed. We conclude with a discussion as to how the MDL principle can be extended to include other encoding models than those we present here.
Structure-based inference of xml similarity for fuzzy duplicate detection
Authors: Luís Leitão, Pável Calado, Melanie Weis
Venue: Proceedings of the sixteenth ACM conference on Conference on information and knowledge management (2007)

Fuzzy duplicate detection aims at identifying multiple representations of real-world objects stored in a data source, and is a task of critical practical relevance in data cleaning, data mining, or data integration. It has a long history for relational data stored in a single table (or in multiple tables with equal schema). Algorithms for fuzzy duplicate detection in more complex structures, e.g., hierarchies of a data warehouse, XML data, or graph data have only recently emerged. These algorithms use similarity measures that consider the duplicate status of their direct neighbors, e.g., children in hierarchical data, to improve duplicate detection effectiveness. In this paper, we propose a novel method for fuzzy duplicate detection in hierarchical and semi-structured XML data. Unlike previous approaches, it not only considers the duplicate status of children, but rather the probability of descendants being duplicates. Probabilities are computed efficiently using a Bayesian network. Experiments show the proposed algorithm is able to maintain high precision and recall values, even when dealing with data containing a high amount of errors and missing information. Our proposal is also able to outperform a state-of-the-art duplicate detection system on three different XML databases.
Philips experiences in global distributed software development
Authors: Rob Kommeren, Päivi Parviainen
Venue: Empirical Software Engineering (2007)

Global software development is increasingly common. Main expected benefits are improvements in time-to-market efficiency and access to greater--and less costly--resources. A number of problems are still to be solved before the full potential of global development can be obtained. This paper describes the experience of over 10 years of global distributed development at Philips, derived from about 200 projects. We discuss the experience and lessons learnt from multi-site development. Main lessons learned are that explicit agreements and ways of working should be defined for the following areas needing the most attention; team coordination and communication, requirements and architectures, integration, and configuration management. In addition, we discuss the experience gained from subcontracting software development to suppliers. Main lesson learned from subcontracting software development is the need for explicit attention and ways of working with respect to selection of suppliers, specification of the work to be subcontracted and establishment and content of the contract.
Detecting splogs via temporal dynamics using self-similarity analysis
Authors: Yu-Ru Lin, Hari Sundaram, Yun Chi, Junichi Tatemura, Belle L. Tseng
Venue: ACM Transactions on the Web (TWEB) (2008)

This article addresses the problem of spam blog (splog) detection using temporal and structural regularity of content, post time and links. Splogs are undesirable blogs meant to attract search engine traffic, used solely for promoting affiliate sites. Blogs represent popular online media, and splogs not only degrade the quality of search engine results, but also waste network resources. The splog detection problem is made difficult due to the lack of stable content descriptors. We have developed a new technique for detecting splogs, based on the observation that a blog is a dynamic, growing sequence of entries (or posts) rather than a collection of individual pages. In our approach, splogs are recognized by their temporal characteristics and content. There are three key ideas in our splog detection framework. (a) We represent the blog temporal dynamics using self-similarity matrices defined on the histogram intersection similarity measure of the time, content, and link attributes of posts, to investigate the temporal changes of the post sequence. (b) We study the blog temporal characteristics using a visual representation derived from the self-similarity measures. The visual signature reveals correlation between attributes and posts, depending on the type of blogs (normal blogs and splogs). (c) We propose two types of novel temporal features to capture the splog temporal characteristics. In our splog detector, these novel features are combined with content based features. We extract a content based feature vector from blog home pages as well as from different parts of the blog. The dimensionality of the feature vector is reduced by Fisher linear discriminant analysis. We have tested an SVM-based splog detector using proposed features on real world datasets, with appreciable results (90&percnt; accuracy).
A Link Evaluation Model Based on Gauss Distribution for Wireless Sensor Networks
Authors: Sun Pei-gang, Xu Jiu-qiang, Zhao Hai, Zhang Xi-yuan, Zhu Jian, Zhu Si-yuan
Venue: Proceedings of the 2007 IFIP International Conference on Network and Parallel Computing Workshops (2007)

Communication link evaluation plays an important role in the design of upper layer protocols for wireless sensor networks. The paper firstly investigates the existing typical link evaluation metrics in wireless sensor networks based on the platform of MicaZ, then takes packet reception rate as the evaluation metric to experimentally study the characteristics of communication link, and according to the statistic analysis of large amount of sampling values, a link evaluation model based on Gauss distribution is brought forward and validated by the tests. This research is expansible, therefore, the established link evaluation model can provide guidance for application, and also can provide valuable references for the simulation research of upper layer protocols.
A novel optimization approach for minimum cost design of trusses
Authors: Prakash Kripakaran, Abhinav Gupta, John W. Baugh,  Jr.
Venue: Computers and Structures (2007)

This paper describes new optimization strategies that offer significant improvements in performance over existing methods for bridge-truss design. In this study, a real-world cost function that consists of costs on the weight of the truss and the number of products in the design is considered. We propose a new sizing approach that involves two algorithms applied in sequence - (1) a novel approach to generate a ''good'' initial solution and (2) a local search that attempts to generate the optimal solution by starting with the final solution from the previous algorithm. A clustering technique, which identifies members that are likely to have the same product type, is used with cost functions that consider a cost on the number of products. The proposed approach gives solutions that are much lower in cost compared to those generated in a comprehensive study of the same problem using genetic algorithms (GA). Also, the number of evaluations needed to arrive at the optimal solution is an order of magnitude lower than that needed in GAs. Since existing optimization techniques use cost functions like those of minimum-weight truss problems to illustrate their performance, the proposed approach is also applied to the same examples in order to compare its relative performance. The proposed approach is shown to generate solutions of not only better quality but also much more efficiently. To highlight the use of this sizing approach in a broader optimization framework, a simple geometry optimization algorithm that uses the sizing approach is presented. This algorithm is also shown to provide solutions better than the existing results in literature.
An Intelligent Two-Stage Evolutionary Algorithm for Dynamic Pathway Identification From Gene Expression Profiles
Authors: Shinn-Ying Ho, Chih-Hung Hsieh, Fu-Chieh Yu, Hui-Ling Huang
Venue: IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB) (2007)

From gene expression profiles, it is desirable to rebuild cellular dynamic regulation networks to discover more delicate and substantial functions in molecular biology, biochemistry, bioengineering and pharmaceutics. S-system model is suitable to characterize biochemical network systems and capable to analyze the regulatory system dynamics. However, inference of an S-system model of N-gene genetic networks has 2N(N+1) parameters in a set of non-linear differential equations to be optimized. This paper proposes an intelligent two-stage evolutionary algorithm (iTEA) to efficiently infer the S-system models of genetic networks from time-series data of gene expression. To cope with curse of dimensionality, the proposed algorithm consists of two stages where each uses a divide-and-conquer strategy. The optimization problem is first decomposed into N subproblems having 2(N+1) parameters each. At the first stage, each subproblem is solved using a novel intelligent genetic algorithm (IGA) with intelligent crossover based on orthogonal experimental design (OED). At the second stage, the obtained N solutions to the N subproblems are combined and refined using an OED-based simulated annealing algorithm for handling noisy gene expression profiles. The effectiveness of iTEA is evaluated using simulated expression patterns with and without noise running on a single-processor PC. It is shown that 1) IGA is efficient enough to solve subproblems; 2) IGA is significantly superior to the existing method SPXGA; and 3) iTEA performs well in inferring S-system models for dynamic pathway identification.
Integrated Test Solution for embedded UHF/RF SOC
Authors: Sean Lu, Dee-Won Lee
Venue: Proceedings of the 16th Asian Test Symposium (2007)

Modern SOC is trending towards high level integration, UHF/ RF blocks have gradually found their positions in the integration puzzle, such as Digital Video Decoder with integrated satellite set-top box UHF receiver, DOCSIS Cable Modem with integrated CMOS tuner.
Student reflections on an academic service learning experience in a computer science classroom
Authors: Linda D. Webster, Edward J. Mirielli
Venue: Proceedings of the 8th ACM SIGITE conference on Information technology education (2007)

The focus of this paper is to introduce the topic of academic service learning and describe the need for academic service learning experiences in technical fields such as computer science and information technology. The intellectual roots of academic service learning, as discussed by Morton and Saltmarsh, go back to the Progressive Era in U.S. history, particularly in the works of Jane Addams, John Dewey, and Dorothy Day. Service learning has been defined as an activity that provides a benefit to someone else. It is the structured intentional engagement in serving a community that defines academic service learning and differentiates it from other types of service. In academic service learning, both the student learner and the community being served benefit from the experience. Within the fields of information technology and computer science, the need for academic service learning experiences arise partly due to the fact that our fields have traditionally been highly technical. Our approach to teaching an upper-level Topics in Programming course, in addition to the technical software engineering content, was to focus heavily on critical thinking, problem solving, project management, communication, and team dynamics. The instructional delivery method used in our course was a student centered, seminar format focusing on a culminating activity of student engagement in their development of a comprehensive information system for SERVE, Inc., a local community service provider. This paper will summarize selected confidential student comments that expressed the student's perception of the extent to which the service project helped them achieve the learning objectives of the course and how this academic service learning experience contributed to their professional growth and development. These comments are grouped according to the corresponding topics related to course learning objectives and academic service learning goals, including Project Management and Planning, Working with Clients, Documentation, Teamwork/Leadership, and Communication.
Fuzzy adaptive connection admission control for real-time applications in ATM-based heterogeneous networks
Authors: Biao Chen, Yingbi Zhang, John Yen, Wei Zhao
Venue: Journal of Intelligent Fuzzy Systems: Applications in Engineering and Technology (1999)

In this paper, we study connection-oriented communication service in heterogeneous network for real-time applications. Many existing distributed mission-critical systems are deployed over heterogeneous networks. Hence, it is necessary to extend the real-time communication technology to encompass heterogeneous networks. A connection can be considered as a contract between an application and the network&colon; the application specifies the characteristics of the traffic which it may generate and the network agrees to provide the requested quality of service (QoS) to the application. For real-time applications, the most crucial QoS is to meet deadline requirement. We propose a fuzzy intelligent system for connection admission control (CAC). Upon a request of connection establishment, the CAC determines if the worst case delays of the requesting and existing connections can be satisfied given the available network resources. If so, the CAC allocates appropriate network resources to the requesting connection. Our system uses fuzzy logic to capture the knowledge for adapting its strategy to dynamic system status. Our performance study demonstrates that system performance can be improved significantly and consistently with our fuzzy adaptive connection admission control. Our approach is compatible with current network standards and hence can be readily used in practical systems.
Continuous range monitoring of mobile objects in road networks
Authors: Dragan Stojanovic, Apostolos N. Papadopoulos, Bratislav Predic, Slobodanka Djordjevic-Kajan, Alexandros Nanopoulos
Venue: Data Knowledge Engineering (2008)

In contrast to regular queries that are evaluated only once, a continuous query remains active over a period of time and has to be continuously evaluated to provide up to date answers. We propose a method for continuous range query processing for different types of queries, characterized by mobility of objects and/or queries which all follow paths in an underlying spatial network. The method assumes an available 2D indexing scheme for indexing spatial network data. An appropriately extended R*-tree, that primarily is used as an indexing scheme for network segments, provides matching of queries and objects according to their locations on the network or their network routes. The method introduces an additional pre-refinement step which generates main-memory data structures to support efficient, incremental reevaluation of continuous range queries in periodically performed refinement steps.
Understanding the influence of information systems competencies on process innovation: A resource-based view
Authors: Monideepa Tarafdar, Steven R. Gordon
Venue: The Journal of Strategic Information Systems (2007)

The resource based view of firms is used to explore how information system (IS) competencies affect process innovation in an organization. Data was collected through a case study of two process innovations at a healthcare firm in the United States. The findings illustrate how six IS competencies - Knowledge Management, Collaboration, Project Management, Ambidexterity, IT/Innovation Governance, Business-IS Linkages - can differentially affect the conception, development and implementation of process innovations. Implications for researchers and practitioners are drawn from these conclusions and suggestions for further research are proposed.