ppxscal/embedding_network huggingface dataset:
Managing Resource and Servent Reputation in P2P Networks
Authors: Makoto Iguchi, Masayuki Terada, Ko Fujimura
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 7 - Volume 7 (2004)

The openness and anonymity of P2P file-sharing networks have been widely accepted over the last few years. Enormous file-sharing communities in which numerous anonymous users share a variety of resources have been established with the aid of the P2P networks. Users can join the communities with ease without disclosing their identities. However, the openness and anonymity raises the problem of trust, because openness and anonymity also assist malicious users in exploiting the networks and, at the same time, complicate their detection and location.We propose a remedy for this trust problem by introducing a new reputation management model. The unique features of applying reputations to both resources and servents, and dividing the servent reputations into contribution score and evaluation score allow the model to represent the servents' past behavior more accurately. We demonstrate the robustness of our reputation model by subjecting it to several known attacks.
Information sharing with the Oracle database
Authors: Deiter Gawlick, Shailendra Mishra
Venue: Proceedings of the 2nd international workshop on Distributed event-based systems (2003)

Database systems have been designed to manage business critical information and make this information accessible on request to connected clients. There is, however, an ever-increasing need to share relevant information actively with disconnected clients and/or external systems, e.g., to propagate and/or automatically react to relevant information as soon as it becomes available.Leveraging the existing database infrastructure, Oracle created a solution to this problem. The solution is state of the art in terms of functionality and operational characteristics. This Oracle technology is widely used and supports many highly visible applications.
Culture Surprises in Remote Software Development Teams
Authors: Judith S. Olson, Gary M. Olson
Venue: Queue (2003)

Technology has made it possible for organizations to construct teams of people who are not in the same location, adopting what one company calls “virtual collocation.”1 Worldwide groups of software developers, financial analysts, automobile designers, consultants, pricing analysts, and researchers are examples of teams that work together from disparate locations, using a variety of collaboration technologies that allow communication across space and time.
Feed-forward and recurrent neural networks for source code informal information analysis
Authors: Ettore Merlo, Ian McAdam, Renato De Mori
Venue: Journal of Software Maintenance: Research and Practice (2003)

Design recovery, which is a part of the reverse engineering process of source code, must supply programmers with all the information they need to fully understand a program or a system. In this paper, a connectionist method that can be used for design recovery in conjunction with more traditional approaches is proposed for analyzing the informal information (comments and mnemonics) in programs An approach based on artificial neural networks (ANNs) was chosen because of its property of being robust (capable of tolerating noisy inputs), because of its associative memory ability (capable of retrieving a concept given only the context of the input word that originally fired the concept), and because of its generalization power (ability to learn conceptually relevant micro-features of the domain). The proposed approach uses a combination of top down domain analysis (i.e., the creation of a concept hierarchy by a domain expert, to be used in the construction of the training set) and a bottom up approach (i.e., the analysis of the informal information using ANNs).A preprocessing system that extracts the relevant comments and identifier names and transforms them into an input for the ANNs has been developed. Feed-forward neural networks (FNNs) and recurrent neural networks (RNNs) were tried. RNN architectures are capable of learning sequences and are able to make use of the word ordering of the sentence. The networks were trained on part of the source code of an existing system and tested on a different portion of the system code. Test results, consisting of coverage and evaluation figures, are presented. They show a remarkably higher accuracy when ANNs, in general, are used as opposed to simple lexical methods. RNNs, in particular, also show higher coverage and accuracy than FNNs.
Explaining information systems strategic planning (ISSP) behavior: an empirical study of the effects of the role of IS on ISSP
Authors: Jason F. Cohen
Venue: Business strategies for information technology management (2003)

Contingeney theory suggests that various environmental, organizational and managerial factors will influence an organization's approach to IT management. This chapter discusses the contingent nature of information systems strategic planning (ISSP) practices and presents the results of an empirical study of ISSP and the role of IS within 90 leading companies in South Africa. Results of a partial least squares analysis demonstrate the significant effect that perceptions of the future strategic role of IS within an organization have on ISSP behavior. Moreover, it was found that those organizations in the strategic quadrant of the McFarlan grid emphasized ISSP activities, committed more resources to the ISSP process and attributed greater importance to ISSP-business strategic planning integration mechanisms, than those organizations in the other quadrants of the grid. The relationship between ISSP and IS function performance was also significantly higher for firms in the strategic IS environment.
The concorde doesn't fly anymore
Authors: Mordechai (Moti) Ben-Ari
Venue: Proceedings of the 35th SIGCSE technical symposium on Computer science education (2004)

While computing technology has undoubtedly changed the world in which we live, the changes have been exaggerated. Talk of a hi-tech internet-driven revolution during the last decade is inaccurate from a historical perspective: (a) It belittles previous technological achievements; for example, the landings on the moon between 1969-1972 were achieved with less computing capability than a PDA has today. (b) So much of the "new" technology dates back thirty years or more; for example, how many of our students know when the first email was sent? This loss of historical perspective has led to demands for an artifact-driven curriculum that I believe is inadequate for the education of future computer scientists and computational engineers. (The latter is a new term I wish to propose for people engaged in the scientifically-based design and construction of systems that perform computations. It is linguistically modeled on the terms mechanical and electrical engineer, and is intended to take the place of the term software engineer.) A comparison of the CC2001 curriculum with the curriculum of a traditional, "non-revolutionary" engineering discipline points to what I believe the future of CS education should be.
A greedy algorithm for maximizing a linear objective function
Authors: V. V. Shenmaier
Venue: Discrete Applied Mathematics (2004)

It is well known that the problem of finding a maximum-weight base of matroid can be solved by a greedy algorithm. The aim of this paper is to extend this result for some more general problems. One of these problems is maximizing a linear objective function over a family J of integer nonnegative vectors. We establish a number of necessary and sufficient conditions for the greedy algorithm to find an optimal solution in the general and some special cases. For the Boolean case, Goecke et al. (in: Combinatorial Optimization, Lecture Notes in Mathematics, Vol. 1403, Springer, Berlin, 1986, p. 1986) proved that the algorithm works if and only if the so-called strong exchange property holds. We extend this result to a class of non-Boolean vector systems.
Polynomial Abstraction for Verification of Sequentially Implemented Combinational Circuits
Authors: Tarvo Raudvere, Ashish Kumar Singh, Ingo Sander, Axel Jantsch
Venue: Proceedings of the conference on Design, automation and test in Europe - Volume 1 (2004)

Todays integrated circuits with increasing complexity cause the well known state space explosion problem in verification tools. In order to handle this problem a much simpler abstract model of the design has to be created for verification. We introduce the polynomial abstraction technique, which efficiently simplifies the verification task of sequential design blocks whose functionality can be expressed as a polynomial. Through our technique, the domains of possible values of data input signals can be reduced. This is done in such a way that the abstract model is still valid for model checking of the design functionality in terms of the system's control and data properties. We incorporate polynomial abstraction into the ForSyDe methodology, for the verification of clock domain design refinements.
Efficient fast learning automata
Authors: M. S. Obaidat, G. I. Papadimitriou, A. S. Pomportsis
Venue: Information Sciences&mdash;Informatics and Computer Science: An International Journal (2003)

A new class of learning automata which are capable of supporting high-speed real-time applications is introduced. The proposed learning automata have a unique characteristic: they are capable of performing both probability updating and action selection with a computational complexity which is independent of the number of actions. Apart from their low computational complexity, the proposed automata are capable of achieving a high performance when operating in non-stationary stochastic environments.
Providing for continuous risk management in distributed software projects
Authors: Janusz Górski, Jakub Miler
Venue: Artificial intelligence and security in computing systems (2003)

The paper presents a concept of continuous risk management in distributed software development projects. The concept is particularly relevant for critical software applications where risk management is among main project management activities. Our approach recognises that effective and open communication is the prerequisite for successful risk management. Therefore, it concentrates on providing to the project stakeholders a broad and highly available communication channel through which they can communicate risk-related information. The channel has unlimited memory - it registers all incoming information much as the "black box" device memorises all relevant data during an aircraft flight. The collected information can then be analysed from different angles to select and prioritise the most important risks or to analyse the project history in order to find out how risk perception developed during the project course. The description of a tool that embodies those concepts and reports from some validation experiments are also included.
Two-Layer Protein Structure Comparison
Authors: Sung-Joon Park, Masayuki Yamamura
Venue: Proceedings of the 15th IEEE International Conference on Tools with Artificial Intelligence (2003)

Extracting biological importance from protein structures is extremely helpful to understand the molecular nature. Although methods for protein structure-based alignment have been hitherto proposed in a number of ways, each method focuses on a part of alignment possibility. We have developed a generic method for pairwise structure-based alignment utilizing the population search ability of a Real-coded Genetic Algorithm. Our method simultaneously optimizes vector-expressed local fragment posture and global atomic superposition. Here, we report comparative results derived from the proposed method and existing methods. The experiments use three protein pairs well studied and a number of pairs derived from diverse protein families. The results show that our method provides useful two-layer similarity and statistical signi.cance at a time to be able to capture not only the remarkable difference between local alignment and global alignment but also biologically meaningful common folds and motifs. Interestingly, we unveiled a vague region in protein structure-function relationships. It may indicate the limit of using alpha-carbon backbones.
A 270 MHz, 1 Vpk-pk, Low-Distortion Variable Gain Amplifier in a 0.35 &mu;m CMOS Process
Authors: Siang Tong Tan, José Silva-Martínez
Venue: Analog Integrated Circuits and Signal Processing (2004)

A fully balanced CMOS Variable Gain Amplifier (VGA) based on current-mode techniques suitable for high frequency applications and large signals is presented. The VGA consists of an analog multiplier, current gain stages, and resistive loads. A frequency compensation scheme based on a capacitive feed-forward technique increases the bandwidth by more than 60%. Common-Mode Feed-Forward (CMFF) techniques are used to minimize dc offsets. The gain can be programmed from 0 to 42 dB with &minus;3 dB bandwidth greater than 270 MHz&semi; a gain calibration scheme for precise gain control applications is included. The Third Harmonic Distortion (HD3) is less than &minus;55 dB for differential input and output voltages of 1 Vpk-pk. The VGA was fabricated in a standard 0.35 &mu;m CMOS process, and consumes around 54 mW from a single power supply of 2.7 V.
Exploring Logic Block Granularity for Regular Fabrics
Authors: A. Koorapaty, V. Kheterpal, P. Gopalakrishnan, M. Fu, L. Pileggi
Venue: Proceedings of the conference on Design, automation and test in Europe - Volume 1 (2004)

Driven by the economics of design and manufacturing nanoscale integrated circuits, an emphasis is being placed on developing new, regular logic fabrics that leverage the regularity and programmability of FPGAs, yet deliver a level of performance and density close to ASICs. One example of such a fabric is a Via-Patterned Gate Array (VPGA) [9], which employs ASIC style global routing on top of an array of patternable logic blocks (PLBs). Previous work [8], [6], [10] showed that by employing even limited heterogeneity for the VPGA logic blocks, namely combining a 3-LUT with two 3-input Nand gates, one can achieve performance comparable to that provided by standard cells. Since the area cost for such heterogenity is far less for a VPGA than for SRAM programmed fabrics such as FPGAs, we can explore new configurations of via-configurable logic blocks that offer greater heterogenity and granularity to achieve even higher performance. In this paper, we present a new, more granular, via-patterned heterogeneous logic block architecture and compare it to a less granular LUT-based heterogeneous PLB. Our results show higher performance and more effective packing of the logic functions due to increased granularity.
Design of a parameterizable Silicon intellectual property core for QR-based RLS filtering
Authors: Gaye Lightbody, Roger Woods, Richard Walke
Venue: IEEE Transactions on Very Large Scale Integration (VLSI) Systems (2003)

The availability of an intellectual property core for recursive least squares (RLS) filtering could enable the RLS algorithm to replace the least mean squares algorithm in a wide range of applications. The goal of this study is to develop a parameterizable generic architecture for RLS filtering in the form of a hard-ware description language (HDL) description, which can be used to generate highly efficient silicon layout. The key issue is to develop a family of circuit architectures that are 100% efficient and locally connected. This paper presents a generic mapping for RLS filtering and circuit architectures that can be mapped to a range of application requirements. It outlines the transition from array to architecture covering detailed design issues such as timing and control generation. The result is a family of QR designs, which are parameterized in terms of architecture size, wordlength, performance, and arithmetic processor timing.
A Ratio Inequality for Binary Trees and the Best Secretary
Authors: Grzegorz Kubicki, Jenö Lehel, Michał Morayne
Venue: Combinatorics, Probability and Computing (2002)

Let Tn be the complete binary tree of height n considered as the Hasse diagram of a poset with its root 1n as the maximum element. Define A(n; T) = &mid;{S &sube; Tn : 1n &isin; S, S &cong; T}&mid;, and B(n; T) = &mid;{S &sube; Tn : 1n &notin; S, S &cong; T}&mid;. In this note we prove that ***** insert equation here ***** for any fixed n and rooted binary trees T1, T2 such that T2 contains a subposet isomorphic to T1. We conjecture that the ratio A&#x002F;B also increases with T for arbitrary trees. These inequalities imply natural behaviour of the optimal stopping time in a poset extension of the secretary problem.
New Methods for Digital Modeling of Historic Sites
Authors: Peter K. Allen, Alejandro Troccoli, Benjamin Smith, Stephen Murray, Ioannis Stamos, Marius Leordeanu
Venue: IEEE Computer Graphics and Applications (2003)

Preserving cultural heritage and historic sites is an important problem. These sites are subject to erosion and vandalism, and as long-lived artifacts, they have gone through many phases of construction, damage, and repair. Keeping accurate record of these sites using 3D model building technology lets preservationists track changes and foresee structural problems; it also allows a wider audience to virtually see and tour these sites. Due to the complexity of these sites, building 3D models is time consuming and difficult, usually involving much manual effort. This article discusses automatic methods that can reduce the time it takes to build a model. The methods use range image segmentation and feature extraction algorithms. The algorithm automatically computes pairwise registrations between individual scans, builds a topological graph, and places the scans in the same frame of reference. The methods can be extended to automate the texture mapping process as well, to create both geometric and photometric realistic models.
Accessibility Verification of WWW Documents by an Automatic Guideline Verification Tool
Authors: Yoshiaki Takata, Takeshi Nakamura, Hiroyuki Seki
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 4 - Volume 4 (2004)

Since the World Wide Web (WWW) is currently the principal infrastructure used by the general public, web site creators are required to build universally accessible sites. Accessibilityguidelines such as the Web Content Accessibility Guidelines (WCAG) show the creators how to make accessible web pages. Also, tools which automatically verify whether or not a given web page complies with the guidelines are provided. Although those tools are useful, applyingthem to any document format other than HTML or any guidelines other than WCAG is difficult, since these tools assume a fixed set of guidelines (e.g., WCAG) and a fixed document format (e.g., HTML). That is, changing the built-in guidelines (e.g., verifying whether a given document complies with the guidelines defined by their organization) requires modifying the tool.This paper proposes a simple and clear language for specifying guidelines, and discusses a verification tool which has the following characteristics.A guideline specification is separated from the tool and can be easily modified.An arbitrary XML document can be verified.The tool can be used not only for accessibility guideline verification but also for complex syntactic checking.We also present the verification results conducted on about 3,000 web pages of forty major organizations in the U.S.A. and Japan using our verification tool.
On-line scheduling of scalable real-time tasks on multiprocessor systems
Authors: Wan Yeon Lee, Sung Je Hong, Jong Kim
Venue: Journal of Parallel and Distributed Computing (2003)

The computation time of scalable tasks depends on the number of processors allocated to them in multiprocessor systems. As more processors are allocated to a scalable task, the overall computation time of the task decreases but the total amount of processors' time devoted to the execution of the task, called workload, increases due to parallel execution overhead. In this paper, we propose a task scheduling algorithm that utilizes the property of scalable tasks for on-line and real-time scheduling. In the proposed algorithm, the total workload of all scheduled tasks is reduced by managing processors allocated to the tasks as few as possible without missing their deadlines. As a result, the processors in the system have less load to execute the scheduled tasks and can execute more newly arriving tasks before their deadlines. Simulation results show that the proposed algorithm performs significantly better than the conventional algorithm based on a fixed number of processors to execute each task.
The flexibility and complexity of information systems development projects: conceptual frameworks, measures, and empirical tests
Authors: Gordon B. Davis, Weidong Xia
Venue:  (2003)

Information systems development projects (ISDPs) are known for a high failure rate. This high failure rate can largely be attributed to the complexity and changes involved during ISDP lifecycles. In complex, dynamic environments, ISDP team flexibility to respond to various changes becomes critical to improved project performance. However, there has been a lack of understanding about the relationships between flexibility, complexity and the performance of ISDPs. The objectives of this dissertation are three-fold. First, the dissertation conceptualizes ISDP flexibility and develops a measurement for the construct. Second, it develops a conceptual framework and a measurement for assessing ISDP complexity. Third, drawing upon the contingency perspectives, it examines the effects of ISDP flexibility on IS performance under varying degrees of ISDP complexity. This dissertation uses a five-phase research method to achieve the research objectives. It employs field interviews, focus group discussions, pretests, pilot tests, and a large-scale cross-sectional survey with 505 ISDP managers. The dissertation examines two types of ISDP flexibility: the extent of response by the project team to changes and the efficiency of response. A 25-item measurement of ISDP flexibility is developed and validated using confirmatory factor analysis. A two dimensional conceptual framework is proposed to define four types of ISDP complexity: structural organizational complexity, structural IT complexity, dynamic organizational complexity, and dynamic IT complexity. A 20-item measurement of ISDP complexity is developed and validated. The research finds that both types of ISDP flexibility have positive main effects on IS performance. However, the effect of ISDP flexibility on IS performance is stronger when ISDP complexity is higher than when it is lower. There was a negative relationship between the two types of ISDP flexibility. The research provides conceptual frameworks and validated measures of ISDP flexibility and ISDP complexity. With these measures, IS managers can use them to assess and better manage their projects. The research provides empirical evidence about the relationships between flexibility, complexity and the performance of ISDPs. The findings suggest that flexibility generally improves project performance. However, managers need to assess the degree of project complexity to determine the appropriate level of ISDP flexibility.