ppxscal/embedding_network huggingface dataset:
Interorganizational trust in B2B relationships
Authors: Carol Saunders, Yu "Andy" Wu, Yuzhu Li, Shawn Weisfeld
Venue: Proceedings of the 6th international conference on Electronic commerce (2004)

While research about trust in B2C relationships appears to be flourishing, we contend that trust in B2B relationships remains underexplored. As the first step toward the remedy of this, we conducted a review of studies in which trust in B2B relationships has been covered, albeit to varied extents. We found that, contrary to the authors' and our expectation, there appeared to be a set of common characteristics among the definitions of trust in those studies. We explored in depth five key dimensions of trust that have been discussed most frequently. They reflect the richness of the concept of trust in B2B relationships. Since, within the context of B2B, trust should not be viewed separately from technologies, we discussed the conceptualizations with which technologies may be viewed as related to trust in B2B. We found that IT has been most commonly viewed either as a tool or nominally. The time factor of trust also is discussed, followed by our conclusion on the commonalities and gaps among the current studies on trust in B2B relationships.
Improving Middleware Performance with AdOC: An Adaptive Online Compression Library for Data Transfer
Authors: Emmanuel Jeannot
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01 (2005)

In this article, we present the AdOC (Adaptive Online Compression) library. It is a user-level set of functions that enables data transmission with compression. The compression is performed dynamically during the transmission and the compression level is constantly adapted according to the environment. In order to ease the integration of AdOC into existing software the API is very close to the read and write UNIX system calls and respects their semantic. Moreover this library is thread-safe and is ported to many UNIXlike systems. We have tested AdOC under various conditions and with various data types. Results show that the library outperforms the POSIX read/write system calls on a broad range of networks (up to 100 Mbit LAN), whereas on Gbit Ethernet, it provides similar performance.
Open source application spaces: the 5th workshop on open source software engineering
Authors: Joseph Feller, Karim Lakhani, Brian Fitzgerald, Walt Scacchi, Scott Hissam
Venue: Proceedings of the 27th international conference on Software engineering (2005)

The goal of the 5th Workshop on Open Source Software Engineering is to bring together researchers and practitioners for the purpose of building a roadmap of the ways in which various computing application spaces have been impacted by open source software and also by open source development methods, tools and organizational structures.
A visual recipe book for persons with language impairments
Authors: Kimberly Tee, Karyn Moffatt, Leah Findlater, Eve MacGregor, Joanna McGrenere, Barbara Purves, Sidney S. Fels
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (2005)

Cooking is a daily activity for many people. However, traditional text recipes are often prohibitively difficult to follow for people with language disorders, such as aphasia. We have developed a multi-modal application that leverages the retained ability of aphasic individuals to recognize image-based representations of objects, providing a presentation format that can be more easily followed than a traditional text recipe. Through a systematic approach to developing a visual language for cooking, and the subsequent case study evaluation of a prototype developed according to this language, we show that a combination of visual instructions and navigational structure can help individuals with relatively large language deficits to cook more independently.
Geometry and learning curves of kernel methods with polynomial kernels
Authors: Kazushi Ikeda
Venue: Systems and Computers in Japan (2004)

The properties of learning machines with polynomial kernel classifiers, such as support vector machines or kernel perceptrons, are examined. We first derive the number of effective examples which are related to generalization error. Next, we analyze the average prediction errors of several algorithms and show these errors do not depend on the apparent dimension of the feature space. This means that what is called the overfitting phenomena do not appear in kernel methods with polynomial kernels. &copy; 2004 Wiley Periodicals, Inc. Syst Comp Jpn, 35(7): 41&ndash;48, 2004; Published online in Wiley InterScience (). DOI 10.1002&sol;scj.10629
Power-Performance Trade-Offs for Reconfigurable Computing
Authors: Juanjo Noguera, Rosa M. Badia
Venue: Proceedings of the international conference on Hardware/Software Codesign and System Synthesis: 2004 (2004)

In this paper, we explore the system-level power-performance trade-offs available when implementing streaming embedded applications on fine-grained reconfigurable architectures. We show that an efficient hardware-software partitioning algorithm is required when targeting low-power. However, if the application objective is performance, then we propose the use of dynamically reconfigurable architectures. This work presents a configuration-aware data size partitioning approach. We propose a design methodology that adapts the architecture and used algorithms to the application requirements. The methodology has been proven to work on a real research platform based on Xilinx devices. Finally, we have applied our methodology and algorithms to the case study of image sharpening, which is required nowadays in digital cameras and mobile phones.
Equivalences among aggregate queries with negation
Authors: Sara Cohen, Yehoshua Sagiv, Werner Nutt
Venue: ACM Transactions on Computational Logic (TOCL) (2005)

Query equivalence is investigated for disjunctive aggregate queries with negated subgoals, constants and comparisons. A full characterization of equivalence is given for the aggregation functions count, max, sum, prod, top2 and parity. A related problem is that of determining, for a given natural number N, whether two given queries are equivalent over all databases with at most N constants. This problem is called bounded equivalence. A complete characterization of decidability of bounded equivalence is given. In particular, it is shown that this problem is decidable for all the above aggregation functions as well as for cntd (count distinct) and avg. For quasilinear queries (i.e., queries in which predicates that occur positively are not repeated), it is shown that equivalence can be decided in polynomial time for the aggregation functions count, max, sum, prty, prod, top2 and avg. A similar result holds for cntd provided that a few additional conditions hold. The results are couched in terms of abstract characteristics of aggregation functions, and new proof techniques are used. Finally, the results above also imply that equivalence, under bag-set semantics, is decidable for nonaggregate queries with negation.
Book review: Using Excel: Macintosh Versionby Christopher Van Buren (Que Corporation)
Venue: ACM SIGSMALL/PC Notes (1991)

This book attempts to provide a complete coverage of Microsoft Excel, Version 2.2 in a fashion that the novice can understand. It is the reviewer's opinion that the result is not bad, but that a subject this broad might need more exposition than a single book can achieve. 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
Transition Tests for High Performance Microprocessors
Authors: Yi-Shing Chang, Sreejit Chakravarty, Hiep Hoang, Nick Thorpe, Khen Wee
Venue: Proceedings of the 23rd IEEE VLSI Test Symposium (2005)

The scope and need for scan based transition tests in the context of high volume manufacturing testing of microprocessors is discussed. A classification of transition faults for latch based design is presented. Finally, we discuss a silicon experiment to understand the most fundamental issue of scan based transition testing viz. their robustness.
A group formation support system based on substitute goods in group buying
Authors: Tokuro Matsuo, Takayuki Ito
Venue: Systems and Computers in Japan (2004)

In electronic marketplaces, group buying is seen as an effective form of electronic commerce and a promising field for applying agent technologies. We study decision support systems for buyers in group buying. In group buying, when buyers cooperate with each other, a seller can discount the price of a good. In many existing group buying sites, some sellers deal in the same sort goods or their imitations. Buyers form coalitions for each item on sale. Buyers cannot always purchase goods at a lower price, because the buyers' subgroups are distributed. Buyers need to search hard to find goods they can purchase. In this paper, we propose a group buying marketplace on the Internet. In our marketplace, buyers can purchase goods at a lower price by forming coalitions. Our system can provide a service in which buyers are integrated based on their multiattribute preferences (utilities). Our system supports buyers' decision making by using the Analytic Hierarchy Process. We propose three methods for group integration. First, buyers trade in simple group buying. Second, all buyers are integrated. Third, some buyers are integrated. The advantages of our market are that buyers' multiattribute utilities are effectively expressed in group integration and buyers can purchase goods at a lower price. Buyers' payments are decided based on their degree of compromise. A successful seller can sell goods in their stock. &copy; 2004 Wiley Periodicals, Inc. Syst Comp Jpn, 35(10): 23&ndash;31, 2004; Published online in Wiley InterScience (). DOI 10.1002&sol;scj.10695
Numerical modelling of some two-phase fluid flow problems
Authors: Stanislav Mika, Marek Brandner
Venue: Mathematics and Computers in Simulation (2004)

Hydrodynamic (fluid flow) problems in general are actual from the wide points of view. The ecological catastrophe in the Czech Republic (2002), especially flooding of Pilsen, gives us new impulses for numerical simulation of particular fluid flow problems. Here we discuss two variants of mathematical fluid flow models: the multiphase compressible inviscid fluid flow model and the multi-component incompressible viscous fluid flow model.The first type of fluid flow problems is oriented to modelling the steam flow with the population of the condensation nuclei of chemical impurities in power equipment. In this case, our global mathematical model (with turbulent structure) has the form ∂U/∂t + ∂F(U)/∂x + ∂G(U)/∂y = H(U), i.e., consists of PDE system of 10 equations. Here, we connect the macroprocess of the steam flow described by standard conservation laws with microprocesses of evolution of condensation nuclei. The last six equations of our system are taken in the form of the transport law ∂ρQi/∂t + div(ρQiu) = h(U) where ρQi are some components of the vector U (describing the sort of the condensation particles, their quantity, volume, etc.). In our simulations, we compare the higher-order relaxation schemes and the monotonic upstream schemes (MUSCL) based on the Godunov approach.In the second model, we consider the problem with the moving interface of different components of the fluid. The movement of the interface will be described by a special transport equation (volume fraction equation) with zero inlet boundary condition. This model gives a possibility to simulate the oil-water flow after oil spill as a flow of two immiscible incompressible viscous components.
Design and analysis of simple irregular LDPC codes with finite-lengths and their application in CDMA systems: Research Articles
Authors: Mahmoud Rashidpour, Seyed Hamaidreza Jamali
Venue: Wireless Communications Mobile Computing (2005)

In this paper, we design and optimize simple irregular low-density parity-check (LDPC) codes for finite-length applications where the asymptotic noise threshold of the channel cannot play as a dominant optimization factor. Our design procedure is based on some observations resulted from analytical study of these codes. Although we present our design procedure for some specified rates but it can generally be used for any rate. Specifically, we design a simple irregular LDPC code for IS-95 and compare its performance with the other reported codes [1&ndash;3] for this application. Our results show a 3.7-fold increase in the capacity at bit error rate (BER) equal to 10-5 compared to the low-rate orthogonal convolutional codes and 1.2 times increase compared to a high performance LDPC code of Reference [3]. Copyright &copy; 2004 John Wiley & Sons, Ltd.
Confidence-based data management for personal area sensor networks
Authors: Nesime Tatbul, Mark Buller, Reed Hoyt, Steve Mullen, Stan Zdonik
Venue: Proceeedings of the 1st international workshop on Data management for sensor networks: in conjunction with VLDB 2004 (2004)

The military is working on embedding sensors in a "smart uniform" that will monitor key biological parameters to determine the physiological status of a soldier. The soldier's status can only be determined accurately by combining the readings from several sensors using sophisticated physiological models. Unfortunately, the physical environment and the low-bandwidth, push-based personal-area network (PAN) introduce uncertainty in the inputs to the models. Thus the model must produce a confidence level as well as a physiological status value. This paper explores how confidence levels can be used to influence data management decisions. In particular, we look at power-efficient ways to keep the confidence above a given threshold. We also contrast push-based broadcast schedules with other schedules that are made possible by two-way communication.
Modeling and Managing Content Changes in Text Databases
Authors: Panagiotis G. Ipeirotis, Alexandros Ntoulas, Junghoo Cho, Luis Gravano
Venue: Proceedings of the 21st International Conference on Data Engineering (2005)

Large amounts of (often valuable) information are stored in web-accessible text databases. "Metasearchers" provide unified interfaces to query multiple such databases at once. For efficiency, metasearchers rely on succinct statistical summaries of the database contents to select the best databases for each query. So far, database selection research has largely assumed that databases are static, so the associated statistical summaries do not need to change over time. However, databases are rarely static and the statistical summaries that describe their contents need to be updated periodically to reflect content changes. In this paper, we first report the results of a study showing how the content summaries of 152 real web databases evolved over a period of 52 weeks. Then, we show how to use "survival analysis" techniques in general, and Coxýs proportional hazards regression in particular, to model database changes over time and predict when we should update each content summary. Finally, we exploit our change model to devise update schedules that keep the summaries up to date by contacting databases only when needed, and then we evaluate the quality of our schedules experimentally over real web databases.
No-Capture Hardware Feature for Securing Sensitive Information
Authors: Khaled Hussain, Sharon Rajan, Naveen Addulla, Ghada Moussa
Venue: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume I - Volume 01 (2005)

Protecting sensitive information (credit card information, social security number ...etc) from being captured is of utmost importance as it can lead to serious repercussions if the collected data lands into unscrupulous hands. Despite tremendous advances in security, plenty of security problems still afflict systems. Existing security approaches do not prevent processes running in the background from capturing sensitive information on the screen. This paper proposes a no-capture hardware security feature that prevents capturing of sensitive data by users that have administration privileges.
Antecedents of computer technology usage: considerations of the technology acceptance model in the academic environment
Authors: Khaled Alshare, Elizabeth Grandon, Don Miller
Venue: Journal of Computing Sciences in Colleges (2004)

Several factors have to be taken into account in order to guarantee computer usage. In this study, we focused attention on some of these factors and created a theoretical model to better understand the relationship between computer literacy, attitudes, perceived ease of use, and perceived usefulness as determinants of computer usage. Additionally, we examined the impact of some external variables such as gender, income, and others on computer literacy, perceived ease of use, perceived usefulness, and attitudes toward computers. We studied these relationships and investigated how gender and educational background mediate the hypothesized relationships. To validate the research model, we collected data from 166 students at a regional Midwest university. Finding support for the proposed model is of vital importance for organizations that can make better decisions when facing employee training issues and also for scholars and curriculum administrators. The results showed that gender, traditional vs. non-traditional students categories, educational background (business vs. non-business), classification (full-time vs. part-time) were not significant factors in affecting students' computer usage. However, income, self-reported measure of computer knowledge, perceived ease of use, perceived usefulness, computer literacy, and attitudes toward computers (positive vs. negative) were significant factors that impacted students' computer usage.
The design, implementation, and evaluation of adaptive code unloading for resource-constrained devices
Authors: Lingli Zhang, Chandra Krintz
Venue: ACM Transactions on Architecture and Code Optimization (TACO) (2005)

Java Virtual Machines (JVMs) for resource-constrained devices, e.g., hand-helds and cell phones, commonly employ interpretation for program translation. However, compilers are able to produce significantly better code quality, and, hence, use device resources more efficiently than interpreters, since compilers can consider large sections of code concurrently and exploit optimization opportunities. Moreover, compilation-based systems store code for reuse by future invocations obviating the redundant computation required for reinterpretation of repeatedly executed code.However, code storage required for compilation can increase the memory footprint of the virtual machine (VM) significantly. As a result, for devices with limited memory resources, this additional code storage may preclude some programs from executing, significantly increase memory management overhead, and substantially reduce the amount of memory available for use by the application.To address the limitations of native code storage, we present the design, implementation, and empirical evaluation of a compiled-code management system that can be integrated into any compilation-based JVM. The system unloads compiled code to reduce the memory footprint of the VM. It does so by dynamically identifying and unloading dead or infrequently used code; if the code is later reused, it is recompiled by the system. As such, our system adaptively trades off memory footprint and its associated memory management costs, with recompilation overhead. Our empirical evaluation shows that our code management system significantly reduces the memory requirements of a compile-only JVM, while maintaining the performance benefits enabled by compilation.We investigate a number of implementation alternatives that use dynamic program behavior and system resource availability to determine when to unload as well as what code to unload. From our empirical evaluation of these alternatives, we identify a set of strategies that enable significant reductions in the memory overhead required for application code. Our system reduces code size by 36--62&percnt;, on average, which translates into significant execution-time benefits for the benchmarks and JVM configurations that we studied.
Who is "the IT workforce"?: challenges facing policy makers, educators, management, and research
Authors: Michelle L. Kaarst-Brown, Indira R. Guzman
Venue: Proceedings of the 2005 ACM SIGMIS CPR conference on Computer personnel research (2005)

Despite over six decades of research on the role and definition of the IT workforce, there remain numerous, and often contradictory, definitions related to the identity of this group. The IT workforce is made up of IT professionals, computer scientists, software developers, and business professionals trained in MIS, as well as various occupational sub-categories in organizations including programmer, analyst, network specialist, and project manager, to name only a few. Despite this, some researchers, funding organizations, and practitioners refer to the "IT workforce" as if this term represents a homogeneous group of individuals that is clearly defined and understood. Our findings contradict this assumption, and raise a number of challenges for management, researchers, policy makers, educators, and funding agencies. We argue that a clear definition of the IT workforce would assist at all levels, and might bring some additional clarity to training, hiring, and retention issues.
Precoloring Extensions of Brooks' Theorem
Authors: Michael O. Albertson, Alexandr V. Kostochka, Douglas B. West
Venue: SIAM Journal on Discrete Mathematics (2005)

Let G be a connected graph with maximum degree k (other than a complete graph or odd cycle), let W be a precolored set of vertices in G inducing a subgraph F, and let D be the minimum distance in G between components of F. If the components of F are complete graphs and $D\ge 8$ (for $k\ge 4$) or $D\ge 10$ (for k = 3), then every proper k-coloring of F extends to a proper k-coloring of G. If the components of F are single vertices and $D\ge 8$, and the vertices outside W are assigned color lists of size k, then every k-coloring of F extends to a proper coloring of G with the color on each vertex chosen from its list. These results are sharp.
Transpose-free multiple Lanczos and its application in Padé approximation
Authors: Man-Chung Yeung, Daniel Boley
Venue: Journal of Computational and Applied Mathematics (2005)

A transpose-free two-sided nonsymmetric Lanczos method is developed for multiple starting vectors on both the left and right. The method is mathematically equivalent to the two-sided methods without look-ahead or deflation steps, but avoids the use of the transpose of the system matrix. The method is applied to the computation of the matrix Padé approximation to a linear dynamical system. The result is a method which can be labeled transpose-free matrix Padé via Lanczos (TFMPVL). Under certain circumstances, TFMPVL will actually reduce the total number of matrix-vector products needed. It is illustrated with some numerical examples.