ppxscal/embedding_network huggingface dataset:
Determinants of ASP choice: an integrated perspective
Authors: Bandula Jayatilaka, Andrew Schwarz, Rudy Hirschheim
Venue: European Journal of Information Systems (2003)

With the rise in the availability of scalable network technologies and resources, Application Service Providers (ASPs) have become increasingly more feasible sources for obtaining IS services. ASP research represents an opportunity to integrate previous research on outsourcing, applied in the area of ASP choice. Historically, outsourcing research has adopted many theoretical perspectives, including transaction cost, resource-based, resource-dependence, and knowledge-based. We apply these perspectives in the ASP context. When obtaining IS services through an ASP, factors other than cost and those explained by the resource-based and resource-dependent perspectives can become paramount. The knowledge-based perspective enables us to examine knowledge risk and integration requirements. Drawing upon past research and an exploratory study conducted with 35 respondents in 11 firms, an integrated, theoretical model is proposed, which combines the transaction cost, resource-based, resource dependency and knowledge-based perspectives. The model is used to explain the antecedent conditions useful for making decisions on IT sourcing through ASPs.
A performance comparison of Mobile IPv6, Hierarchical Mobile IPv6, fast handovers for Mobile IPv6 and their combination
Authors: Xavier Pérez-Costa, Marc Torrent-Moreno, Hannes Hartenstein
Venue: ACM SIGMOBILE Mobile Computing and Communications Review (2003)

Mobile IP, the current IETF proposal for IP mobility support, represents a key element for future All-IP wireless networks to provide service continuity while on the move within a multi-access environment. We conducted a performance evaluation of Mobile IPv6 and its proposed enhancements, i.e., Fast Handovers for Mobile IPv6, Hierarchical Mobile IPv6 and our proposed combination of them, using the network simulator ns-2 for the case of a 'hot spot' deployment scenario. The simulation scenario comprises four access routers and up to 50 mobile nodes that communicate in accordance with the IEEE 802.11 wireless LAN standard. The study provides quantitative results of the performance improvements obtained by the proposed enhancements as observed by a single mobile user with respect to handoff latency, packet loss rate and achieved bandwidth per station. As a complementary part of the study, the signaling load costs associated with the performance improvements provided by the enhancements has been analyzed. The simulation environment allowed us also to investigate the behavior of the protocol in extreme cases, e.g., under channel saturation conditions and considering different traffic sources: CBR, VoIP, Video and TCP transfers. While some simulation results corroborate the intention of the protocols specifications, other results give insights not easily gained without performing simulations. This study provides a deep understanding of the overall performance of the various protocols and supports the design process of a Mobile IPv6-based network when a decision of whether it is appropriate to implement any of the proposed Mobile IPv6 enhancements has to be made.
Nonlinear Estimation of the Fundamental Matrix with Minimal Parameters
Authors: Adrien Bartoli, Peter Sturm
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2004)

Abstract--The purpose of this paper is to give a very simple method for nonlinearly estimating the fundamental matrix using the minimum number of seven parameters. Instead of minimally parameterizing it, we rather update what we call its orthonormal representation, which is based on its singular value decomposition. We show how this method can be used for efficient bundle adjustment of point features seen in two views. Experiments on simulated and real data show that this implementation performs better than others in terms of computational cost, i.e., convergence is faster, although methods based on minimal parameters are more likely to fall into local minima than methods based on redundant parameters.
MRF-MAP-MFT visual object segmentation based on motion boundary field
Authors: Jie Wei, Izidor Gertner
Venue: Pattern Recognition Letters (2003)

In our earlier work, a two-pass motion estimation algorithm (TPA) was developed to estimate a motion field for two adjacent frames in an image sequence where contextual constraints are handled by several Markov random fields (MRFs) and the maximum a posteriori (MAP) configuration is taken to be the resulting motion field. In order to provide a trade-off between efficiency and effectiveness, the mean field theory (MFT) was selected to carry out the optimization process to locate the MAP with desirable performance. Given that currently in the disciplines of digital library [IEEE Trans. PAMI 18 (8) (1996); IEEE Trans. Image Process. 11 (8) (2002) 912] and video processing [IEEE Trans. Circ. Sys. Video Tech. 7 (1) (1997)] of utmost interest are the extraction and representation of visual objects, instead of estimating motion field, in this paper we focus on segmenting out visual objects based on spatial and temporal properties present in two contiguous frames in the same MRF-MAP-MFT framework. To achieve object segmentation, a "motion boundary field" is introduced which can turn off interactions between different object regions and in the mean time remove spurious object boundaries. Furthermore, in light of the generally smooth and slow velocities in-between two contiguous frames, we discover that in the process of calculating matching blocks, assigning different weights to different locations can result in better object segmentation. Experimental results conducted on both synthetic and real-world videos demonstrate encouraging performance.
Error Detection in Signed Digit Arithmetic Circuit with Parity Checker
Authors: G. C. Cardarilli, M. Ottavi, S. Pontarelli, M. Re, A. Salsano
Venue: Proceedings of the 18th IEEE International Symposium on Defect and Fault Tolerance in VLSI Systems (2003)

This paper proposes a methodology for the development of simple arithmetic self-checking circuits using Signed Digit representation. In particular, the architecture of an adder is reported and its self-checking capability with respect to the stuck-at fault set is shown. The main idea underlying the paper is to exploit the properties of Signed Digit representation allowing carry-free operations. In a carry free adder the parity can be easily checked allowing therefore detecting the occurrence of a fault belonging to the considered stuck-at fault set. The proposed architecture is therefore very suitable for the implementation of self-checking adders that are also fast due to the same carry free property.
SSTT: efficient local search for GSI global routing
Authors: Tong Jing, Xian Long Hong, Hai Yun Bao, Jing Yu Xu, Jun Gu
Venue: Journal of Computer Science and Technology (2003)

In this paper, a novel global routing algorithm is presented for congestion optimization based on efficient local search, named SSTT (search space traversing technology). This method manages to traverse the whole search space. A hybrid optimization strategy is adopted, consisting of three optimization sub-strategies: stochastic optimization, deterministic optimization and local enumeration optimization, to dynamically reconstruct the problem structure. Thus, "transition" can be made from a local minimum point to reach other parts of the search space, traverse the whole search space, and obtain the global (approximate) optimal routing solution. Since any arbitrary initial routing solution can be used as the start point of the search, the initialization in SSTT algorithm is greatly simplified. SSTT algorithm has been tested on both MCNC benchmark circuits and industrial circuits, and the experimental results were compared with those of typical existing algorithms. The experimental results show that SSTT algorithm can obtain the global (approximate) optimal routing solution easily and quickly. Moreover, it can meet the needs of practical applications. The SSTT global routing algorithm gives a general-purpose routing solution.
The realization of finite state machines by decomposition and the principal lattice of partitions of a submodular function
Authors: M. P. Desai, H. Narayanan, Sachin B. Patkar
Venue: Discrete Applied Mathematics (2003)

In this paper, some problems that arise in the realization of finite state machines (FSM) are shown to be strongly related to the theory of submodular functions. Specifically, we use the idea of the principal lattice of partitions of a submodular function to develop approximation algorithms for minimizing the "cost" of realization of an FSM through a decomposition strategy.
Information technologies in educational organizations: an innovative collaborative course development, delivery and evaluation
Authors: Pamela Lipe Revercomb, Ruth V. Small
Venue: Current issues in IT education (2003)

In this chapter, the collaborative design, development, implementation, and evaluation of a new interdisciplinary course being offered by Syracuse University's School of Information Studies and School of Education are described. The course was offered to graduate students in response to the need to revise two master's degree programs at Syracuse University and in order to satisfy new state competency standards for certification as Educational Technologists and School Library Media Specialists. The course development process, course objectives, course content and activities, and the results of a formative and summative evaluation conducted by the researchers are included, as well as recommendations for future implementation, including distance delivery.
Usability-based caching of query results in OLAP systems
Authors: Chang-Sup Park, Myoung Ho Kim, Yoon-Joon Lee
Venue: Journal of Systems and Software (2003)

In this paper we propose a new cache management scheme for online analytical processing (OLAP) systems based on the usability of query results in rewriting and processing other queries. For effective admission and replacement of OLAP query results, we consider the benefit of query results not only for recently issued queries but for the expected future queries of a current query. We exploit semantic relationships between successive queries in an OLAP session, which are derived from the interactive and navigational nature of OLAP query workloads, in order to classify and predict subsequent future queries. We present a method for estimating the usability of query results for the representative future queries using a probability model for them. Experimental evaluation shows that our caching scheme using the past and future usability of query results can reduce the cost of processing OLAP query workloads effectively only with a small cache size and outperforms the previous caching strategies for OLAP systems.
On the Edge-Expansion of Graphs
Authors: Noga Alon
Venue: Combinatorics, Probability and Computing (1997)

It is shown that if n>n0(d) then any d-regular graph G=(V, E) on n vertices contains a set of u=&lfloor;n&#x002F;2&rfloor; vertices which is joined by at most (d&#x002F;2&minus;c&radic;d)u edges to the rest of the graph, where c>0 is some absolute constant. This is tight, up to the value of c.
Assertion Based Verification Using HDVL
Authors: Kausik Datta, P P. Das
Venue: Proceedings of the 17th International Conference on VLSI Design (2004)

Over the past several years verification of largedesigns are becoming more and more complex - bothin terms of the maintaining the code size and inkeeping parity between the specification written inEnglish; design written in HDL (typically Verilog /VHDL) and the verification models written in HDL orsome proprietary verification language. To alleviatethis problem, Accellera has come up with the proposalfor standardizing an HDVL - a single language thatcaters to all the needs for Design (as an HDL) as wellas Verification (as an HVL - Hardware VerificationLanguage). SystemVerilog [6] standard where the usercan model and verify the correctness of the designsusing a unified language whose syntax and semanticsis already proven and tested in the industry is beingprojected as a candidate HDVL. SystemVerilog is a setof major enhancements to the Verilog 2001[1]standard and these enhancements are taken fromexisting industry standard languages and paradigmsincluding Superlog [3], PSL-Sugar [4], OVA [8] andOVL [7]. In this paper we present an overview of theAssertion based Verification methodology in generaland explain, with suitable examples, how can onebenefit from using an HDVL for the combined purposeof design as well as verification. It attempts to set theright expectations for an engineer from an HDVL andalso illustrates the power of the new paradigm.
Boosting support vector machines for text classification through parameter-free threshold relaxation
Authors: James G. Shanahan, Norbert Roma
Venue: Proceedings of the twelfth international conference on Information and knowledge management (2003)

Support vector machine (SVM) learning algorithms focus on finding the hyperplane that maximizes the margin (the distance from the separating hyperplane to the nearest examples) since this criterion provides a good upper bound of the generalization error. When applied to text classification, these learning algorithms lead to SVMs with excellent precision but poor recall. Various relaxation approaches have been proposed to counter this problem including: asymmetric SVM learning algorithms (soft SVMs with asymmetric misclassification costs); uneven margin based learning; and thresholding. A review of these approaches is presented here. In addition, in this paper, we describe a new threshold relaxation algorithm. This approach builds on previous thresholding work based upon the beta-gamma algorithm. The proposed thresholding strategy is parameter free, relying on a process of retrofitting and cross validation to set algorithm parameters empirically, whereas our previous approach required the specification of two parameters (beta and gamma). The proposed approach is more efficient, does not require the specification of any parameters, and similarly to the parameter-based approach, boosts the performance of baseline SVMs by at least 20% for standard information retrieval measures.
G-Intersecting Families
Authors: Tom Bohman, Alan Frieze, Miklós Ruszinkó, Luboš Thoma
Venue: Combinatorics, Probability and Computing (2001)

Let G be a graph on vertex set [n], and for X &sube; [n] let N(X) be the union of X and its neighbourhood in G. A family of sets &Fscr; &sube; 2[n] is G-intersecting if N(X) &cap; Y &ne; &empty; for all X, Y &isin; &Fscr;. In this paper we study the cardinality and structure of the largest k-uniform G-intersecting families on a fixed graph G.
The Expected Norm of Random Matrices
Authors: Yoav Seginer
Venue: Combinatorics, Probability and Computing (2000)

We compare the Euclidean operator norm of a random matrix with the Euclidean norm of its rows and columns. In the first part of this paper, we show that if A is a random matrix with i.i.d. zero mean entries, then E par;A∥h &le; Kh (E maxi ∥ai&bull; par;h + E maxj ∥aj&bull; ∥h), where K is a constant which does not depend on the dimensions or distribution of A (h, however, does depend on the dimensions). In the second part we drop the assumption that the entries of A are i.i.d. We therefore consider the Euclidean operator norm of a random matrix, A, obtained from a (non-random) matrix by randomizing the signs of the matrix's entries. We show that in this case, the best inequality possible (up to a multiplicative constant) is E∥A par;h &le; (c log1/4 min {m, n})h (E maxi ∥ai&bull; ∥h + E maxj ∥aj&bull; ∥h) (m, n the dimensions of the matrix and c a constant independent of m, n).
The relationship between distributed systems and open software development
Authors: Coskun Bayrak, Chad Davis
Venue: Communications of the ACM (2003)

The behavior and performance of OSD is best appreciated as a distributed system.
Distributed Development: Lessons Learned
Authors: Michael Turnlund
Venue: Queue (2003)

Delivery of a technology-based project is challenging, even under well-contained, familiar circumstances. And a tight-knit team can be a major factor in success. It is no mystery, therefore, why most small, new technology teams opt to work in a garage (at times literally). Keeping the focus of everyone’s energy on the development task at hand means a minimum of non-engineering overhead.
A Virtual-Reality Based Integrated Driving-Traffic Simulation System to Study the Impacts of Intelligent Transportation Systems (ITS)
Authors: Ming Jin, Soi-Hoi Lam
Venue: Proceedings of the 2003 International Conference on Cyberworlds (2003)

Travel behaviour under information is a complexprocess which includes traveller interaction with theenvironment and consequent information. This processwere not fully explored in the past studies because thedifficulties in collecting the data. In this paper, a VRbased integrated driving-traffic simulation system ispresented to collect data needed to address the travellersbehaviour under information. The major advantage isthat this system has sophisticated control on generatedtraffic condition and consequent information, which arecrucial for the studies on information impacts on travelbehaviour. The conceptual design of integrated systemis discussed in this paper. In addition, results from apilot study are also discussed. The results of the pilotstudy provide some information on future experimentdesigns with developed system.
Cross-platform CD index
Authors: Shawn P. Garbett
Venue: Linux Journal (2003)

We liked this easy JavaScript-based CD-ROM search system so much, we used it on the 1994-2002 Linux Journal archive CD. 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
Scheduling requests on multi-stage multi-server to increase quality of service
Authors: Ali Allahverdi, Fawaz S. Al-Anzi
Venue: Network control and engineering for Qos, security and mobility II (2003)

In this paper, we consider the problem of scheduling on a multi-stage multiserver architecture in computer centers to enhance quality of service through minimizing the average completion time of a set of requests. This problem is known to be an NP-hard combinatorial problem. We show that the problem can modeled as a flexible flowshop problem for which few heuristics exist in the flowshop scheduling literature. We propose a new heuristic for this problem that consists of three phases. Simulated Annealing is used in the first phase of the heuristic followed by a greedy algorithm phase. The last phase is a local pair-wise exchange procedure. An extensive computational experiment has been conducted to compare the existing heuristics with each other for the first time. Moreover, the proposed heuristic is compared with the existing heuristics. The results indicate that the proposed heuristic significantly outperforms the existing ones.
Using GMDH for modeling economical indices of mine opening
Authors: Ljudmila Sarycheva
Venue: Systems Analysis Modelling Simulation (2003)

Dependency of explicit costs index of mining opening on its parameters is modeled. In addition, the problem of structural identification is solved. Models enumeration is realized with the help of group methods of data handling (GMDH). Least-squares and least-modules methods are used for evaluating model parameters. The quality of resulting models is evaluated by the following criteria: (a) remaining sum of squares criteria; (b) "sliding control" criteria; (c) regularity criteria.
A combined method of local Green's functions and central difference method for singularly perturbed convection-diffusion problems
Authors: O. Axelsson, S. V. Gololobov
Venue: Journal of Computational and Applied Mathematics (2003)

The paper presents a combined finite difference method with local 1D Green's functions along the characteristic lines for the numerical solution of singularly perturbed convection-diffusion problems. The advantages of this technique compared with some commonly used methods are illustrated by numerical experiments with outflow boundary layers. Numerical experiments also show that the method on a Shishkin-type mesh has discretization error of second order uniformly in the perturbation parameter. Moreover, they indicate that for the singularly perturbed problems, unstable methods (like central difference method) can be stabilized in combination with a stable method on a few mesh points.
Influences on cheating practice of graduate students in IT courses: what are the factors?
Authors: Judy Sheard, Martin Dick
Venue: Proceedings of the 8th annual conference on Innovation and technology in computer science education (2003)

This paper presents an analysis of results of a survey of graduate students in IT courses that aimed to gain an understanding of their views of cheating and knowledge of their cheating practice. The survey was part of an investigation into the cheating behaviour of IT students within the Faculty of Information Technology of Monash University. Using a factor analysis technique, categories of cheating behaviour and categories of reasons that could cause cheating or prevent cheating were identified. These were then used to determine possible influences on different types of cheating behaviour. A search of the literature has shown that there is a scarcity of studies of cheating behaviour of IT students, especially at the graduate level. The results of this study are informing an education program and development of policy on student cheating within our Faculty.
Bounds of performance measures in large-scale mobile communication networks
Authors: Toshiomi Takahashi, Toshihisa Ozawa, Yukio Takahashi
Venue: Performance Evaluation (2003)

In this paper, we propose a new method for evaluating performance measures in a mobile communication network having a large number of base stations. Each base station has its own zone where its radio wave reaches. These zones are overlapping with neighboring zones, and handovers become possible. However, the existence of overlapping zones makes the analysis of a network difficult. To overcome this difficulty, we introduce an aggregated process on a smaller state space. For each of the important performance measures, using this aggregated process, we can construct a Markov decision problem that derives an exact upper (or lower) bound. Further, under some condition, we can specify a situation at which the upper (lower) bound is attained. This situation is analyzed with a far smaller model, and we can get the upper (lower) bound numerically or even by simulation.