ppxscal/embedding_network huggingface dataset:
Design and e-loyalty across cultures in electronic commerce
Authors: Dianne Cyr, Carole Bonanni, Joe ilsever
Venue: Proceedings of the 6th international conference on Electronic commerce (2004)

The increasing incidence of Internet shopping necessitates a better understanding of how e-loyalty is built in online transaction environments between businesses and consumers. In the current investigation website design and culture are important elements related to how website trust, website satisfaction, and e-loyalty evolve in online business relationships. A review of the literature is presented, including hypotheses for testing. Based on data collected on site in Canada, the U.S., Germany and Japan, preliminary results are outlined. Based on the data, all hypotheses received support for cross cultural differences concerning trust, satisfaction, loyalty and design preferences for the local website, but not for the foreign website.
Benchmark-Based Design Strategies for Single Chip Heterogeneous Multiprocessors
Authors: JoAnn M. Paul, Donald E. Thomas, Alex Bobrek
Venue: Proceedings of the international conference on Hardware/Software Codesign and System Synthesis: 2004 (2004)

Single chip heterogeneous multiprocessors are arising to meet the computational demands of portable and handheld devices. These computing systems are not fully custom designs traditionally targeted by the Design Automation (DA) community, general purpose designs traditionally targeted by the Computer Architecture (CA) community, nor pure embedded designs traditionally targeted by the real-time (RT) community. An entirely new design philosophy will be needed for this hybrid class of computing. The programming of the device will be drawn from a narrower set of applications with execution that persists in the system over a longer period of time than for general purpose programming. But the devices will still be programmable, not only at the level of the individual processing element, but across multiple processing elements and even the entire chip. The design of other programmable single chip computers has enjoyed an era where the design trade-offs could be captured in simulators such as SimpleScaler and performance could be evaluated to the SPEC benchmarks. Motivated by this, we describe new benchmark-based design strategies for single chip heterogeneous multiprocessors. We include an example and results.
Controlling Camera and Lights for Intelligent Image Acquisition and Merging
Authors: Olena Borzenko, Yves Lesperance, Michael Jenkin
Venue: Proceedings of the 2nd Canadian conference on Computer and Robot Vision (2005)

Docking craft in space and guiding mining machines are areas that often use remote video cameras equipped with one or more controllable light sources. In these applications, the problem of parameter selection arises: how to choose the best parameters for the camera and lights? Another problem is that a single image often cannot capture the whole scene properly and a composite image needs to be rendered. In this paper, we report on our progress with the CITO Lights and Camera project that addresses the parameter selection and merging problems for such systems. The prototype knowledge-based controller adjusts lighting to iteratively acquire a collection of images of a target. At every stage, an entropy-based merging module combines these images to produce a composite. The result is a final composite image that is optimized for further image processing tasks, such as pose estimation or tracking.
English-Chinese CLIR using a simplified PIRCS system
Authors: K. L. Kwok, N. Dinstl, P. Deng
Venue: Proceedings of the first international conference on Human language technology research (2001)

A GUI is presented with our PIRCS retrieval system for supporting English-Chinese cross language information retrieval. The query translation approach is employed using the LDC bilingual wordlist. Given an English query, different translation methods and their retrieval results can be demonstrated.
Realizability and verification of MSC graphs
Authors: Rajeev Alur, Kousha Etessami, Mihalis Yannakakis
Venue: Theoretical Computer Science (2005)

Scenario-based specifications such as message sequence charts (MSC) offer an intuitive and visual way to describe design requirements. MSC-graphs allow convenient expression of multiple scenarios, and can be viewed as an early model of the system that can be subjected to a variety of analyses. Problems such as LTL model checking are undecidable for MSC-graphs in general, but are known to be decidable for the class of bounded MSC-graphs.Our first set of results concerns checking realizability of bounded MSC-graphs. An MSC-graph is realizable if there is a distributed implementation that generates precisely the behaviors in the graph. There are two notions of realizability, weak and safe, depending on whether or not we require the implementation to be deadlock-free. It is known that for a finite set of MSCs, weak realizability is coNP-complete while safe realizability has a polynomial-time solution. We establish that for bounded MSC-graphs, weak realizability is, surprisingly, undecidable, while safe realizability is in EXPSPACE.Our second set of results concerns verification of MSC-graphs. While checking properties of a graph G, besides verifying all the scenarios in the set L(G) of MSCs specified by G, it is desirable to verify all the scenarios in the set Lw(G)--the closure of G, that contains the implied scenarios that any distributed implementation of G must include. For checking whether a given MSC M is a possible behavior, checking M ∈ L(G) is NP-complete, but checking M ∈ Lw(G) has a quadratic solution. For temporal logic specifications, considering the closure makes the verification problem harder: while checking LTL properties of L(G) is PSPACE-complete for bounded graphs G, checking even simple "local" properties of Lw(G) is undecidable.
A corpus-based analysis for the ordering of clause aggregation operators
Authors: James Shaw
Venue: Proceedings of the 19th international conference on Computational linguistics - Volume 1 (2002)

To better understand the ordering of clause aggregation operators in a text generation application, we manually annotated a small corpus. The annotated corpus supports the preferred ordering of transformations that result in shorter surface expressions, such as adjectives over relative clauses. In addition, we were able to explain why paratactic operators are applied before and after hypotactic operators.
A reactive channel model for expediting wireless network simulation
Authors: Chunyu Hu, Jennifer C. Hou
Venue: Proceedings of the 2005 ACM SIGMETRICS international conference on Measurement and modeling of computer systems (2005)

A major problem with leveraging event-driven, packet-level simulation environments, such as ns2[6], J-Sim[1], OpNet[2]), and QualNet[3]), in conducting wireless network simulation is the vast number of events generated, a majority of which are related to signal transmission in the PHY/MAC layers.In this extended abstract, we investigate the operations of signal transmission in the various stages: signal propagation, signal interference, and interaction with the PHY/MAC layers, and identify where events can be reduced without impairing the accuracy. We propose to leverage the MAC/PHY state information, and devise (from the perspective of network simulation) a reactive channel model (RCM) in which nodes explicitly register their interests in receiving certain events according to the MAC/PHY states they are in and the corresponding operations that should be performed. The simulation study indicates that RCM renders an order of magnitude of speed-up without compromising the accuracy of simulation results. An advantage of RCM with respect to the implementation is that there is no need to re-design the channel model for each specific MAC layer, and the modification made in the MAC/PHY layers is quite modest (e.g., a few API changes). This, coupled with the performance gain, suggests that RCM is an attractive, light-weight mechanism for expediting wireless network simulation.
Changes in queries in Gnutella peer-to-peer networks
Authors: Christopher C. Yang, James S.H. Kwok
Venue: Journal of Information Science (2005)

Peer-to-peer (P2P) networks have been drawing significant attention in the area of information management and sharing recently. Unlike the World Wide Web (WWW), every peer in a P2P network is both client and server. It hosts information for sharing and submits queries to search for information from all of the other peers at the same time. There are a large number of studies related to the information behavior of WWW search engines in the US and Europe. Several issues have been investigated in these studies including number of unique and repeat queries, length of queries, terms being used in queries, successive searching, multitasking searching, multiple searching sessions, changes of topics, multimedia searching, etc. The number of similar studies in P2P networks is significantly less. We have previously studied the information behavior of Gnutella P2P network based on data collected in 2002. In this paper, we present changes in Gnutella queries, based on the previously collected data and new data collected in 2003. Similar metrics to those used by Spink, Wolfram, Jansen, and Saracevic and in our previous study are used. We found that the number of non-English queries has increased. The number of repeat queries in P2P has decreased but is still more than that for WWW search engines. The length of queries has been increased by about 40%. The topics of interest have shifted from entertainment and sexuality to computers and entertainment. In general, the information behavior of P2P users has been changing as the P2P technology becomes more mature and the P2P users become more familiar with the technology. As the P2P technology begins to be adopted in e-Business, we foresee that there will be more changes in the future.
Automatic Low Overhead Program Instrumentation with the LOPI Framework
Authors: Simon Kagstrom, Hakan Grahn, Lars Lundberg
Venue: Proceedings of the 9th Annual Workshop on Interaction between Compilers and Computer Architectures (2005)

Program instrumentation is an important technique for a different tasks such as performance measurements, debugging, and coverage analysis. Instrumentation, however, poses two important requirements to be useful: it must be easy to apply and it should perturb the application as little as possible. In this paper, we present the LOPI framework which provides a simple means to automatically instrument binary files with low perturbation. An evaluation of the LOPI framework with detailed measurements of seven SPEC CPU2000 benchmarks show that the it gives lower perturbation in terms of instructions executed and cache behavior than Dyninst. For example, a LOPI instrumented application executes on average 36% more instructions, while a Dyninst instrumented application executes 49% more instructions for a common performance-oriented instrumentation, than the uninstrumented application.
Intelligent web traffic mining and analysis
Authors: Xiaozhe Wang, Ajith Abraham, Kate A. Smith
Venue: Journal of Network and Computer Applications (2005)

With the rapid increasing popularity of the WWW, Websites are playing a crucial role to convey knowledge and information to the end users. Discovering hidden and meaningful information about Web users usage patterns is critical to determine effective marketing strategies to optimize the Web server usage for accommodating future growth. Most of the currently available Web server analysis tools provide only explicitly and statistical information without real useful knowledge for Web managers. The task of mining useful information becomes more challenging when the Web traffic volume is enormous and keeps on growing. In this paper, we propose a concurrent neurofuzzy model to discover and analyze useful knowledge from the available Web log data. We made use of the cluster information generated by a self organizing map for pattern analysis and a fuzzy inference system to capture the chaotic trend to provide short-term (hourly) and long-term (daily) Web traffic trend predictions. Empirical results clearly demonstrate that the proposed hybrid approach is efficient for mining and predicting Web server traffic and could be extended to other Web environments as well.
A common data library in an integrated CAD system for electronics
Authors: V. Tyssø, E. J. Aas
Venue: ACM SIGDA Newsletter (1981)

This paper describes the basic concept, features and implementation of a Common Data Library (CDL) in an integrated CAD/CAM system environment. The work presented is a part of a project called EPOKE, aiming at a totally integrated CAD/CAM system for the Norwegian electronics industry. The EPOKE project is sponsored by the Royal Norwegian Council for Scientific and Industrial Research (NTNF), and is a joint effort between A/S Elektrisk Bureau, A/S Kongsberg V&aring;penfabrikk, the Central Institute for Industrial Research, and ELAB (The Electronics Research Laboratory at the University of Trondheim).
IT Asset Management of Industrial Automation Systems
Authors: Esther Gelle, Thomas E. Koch, Patrick Sager
Venue: Proceedings of the 12th IEEE International Conference and Workshops on Engineering of Computer-Based Systems (2005)

The installation and administration of large heterogeneous IT infrastructures, for enterprises as well industrial automation systems, are becoming more and more complex and time consuming. Industrial automation systems, such as those delivered by ABB Inc., present an additional challenge, in that these control and supervise mission critical production sites. Nevertheless, it is common practice to manually install and maintain industrial networks and the process control software running on them, which can be both expensive and error prone. In order to address these challenges, we believe that in the long term such systems must behave autonomously. As preliminary steps to the realization of this vision, automated IT asset management tools and practices will be highlighted in this contribution. We will point out the advantages of combining process control and network management in the domain of industrial automation technology. Furthermore we will propose a new component model for Autonomic network management applied to industrial automation systems
Hybrid Chinese/English Text Identification in Web Images
Authors: Jiaying He, Shaofa Li
Venue: Proceedings of the Third International Conference on Image and Graphics (2004)

In this paper, a novel algorithm is presented for hybrid Chinese/English text location, segmentation and Chinese character reconstruction in Web images. Since Web images have certain characteristics that distinguish them from conventional complex background images, most text segmentation algorithms with good performance in other fields fail to recognize Web images text. This paper proposes an algorithm that aims to locate and segment hybrid text in Web images, and to retrieve complete Chinese characters using a novel character reconstruction algorithm. Experimental result shows that our approach has high text detection rate and fast processing speed when identifying Web image text, and has promising result in segmentation of oriental text symbols such as Chinese, Japanese and Korea characters.
Medial Axes and Mean Curvature Motion II: Singularities
Authors: Ralph Costa Teixeira
Venue: Journal of Mathematical Imaging and Vision (2005)

What happens to the medial axis of a curve that evolves through MCM (Mean Curvature Motion)? We explore some theoretical results regarding properties of both medial axes and curvature motions. Specifically, using singularity theory, we present all possible topological transitions of a symmetry set (of which the medial axis is a subset) whose originating curve undergoes MCM. All calculations are presented in a clear and organized fashion and are easily generalized for other front motions. A companion article deals with non-singular points of the medial axis through direct calculations.
Fusing Visual and Inertial Sensing to Recover Robot Ego-motion
Authors: Guillem Alenyà, Elisa Martínez, Carme Torras
Venue: Journal of Robotic Systems (2004)

A method for estimating mobile robot ego-motion is presented, which relies on tracking contours in real-time images acquired with a calibrated monocular video system. After fitting an active contour to an object in the image, 3D motion is derived from the affine deformations suffered by the contour in an image sequence. More than one object can be tracked at the same time, yielding some different pose estimations. Then, improvements in pose determination are achieved by fusing all these different estimations. Inertial information is used to obtain better estimates, as it introduces in the tracking algorithm a measure of the real velocity. Inertial information is also used to eliminate some ambiguities arising from the use of a monocular image sequence. As the algorithms developed are intended to be used in real-time control systems, considerations on computation costs are taken into account. &copy; 2004 Wiley Periodicals, Inc.
Properties of Digital Homotopy
Authors: Laurence Boxer
Venue: Journal of Mathematical Imaging and Vision (2005)

Several recent papers have adapted notions of geometric topology to the emerging field of `digital topology.' An important notion is that of digital homotopy. In this paper, we study a variety of digitally-continuous functions that preserve homotopy types or homotopy-related properties such as the digital fundamental group.
Improving the performance of the RISE algorithm
Authors: Aloísio Carlos de Pina, Gerson Zaverucha
Venue: Proceedings of the 8th European Conference on Principles and Practice of Knowledge Discovery in Databases (2004)

RISE is a well-known multi-strategy learning algorithm that combines rule induction and instance-based learning. It achieves higher accuracy than some state-of-the-art learning algorithms, but for large data sets it has a very high average running time. This work presents the analysis and experimental evaluation of SUNRISE, a new multi-strategy learning algorithm based on RISE, developed to be faster than RISE with similar accuracy.
Distract-R: rapid prototyping and evaluation of in-vehicle interfaces
Authors: Dario D. Salvucci, Mark Zuber, Ekaterina Beregovaia, Daniel Markley
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (2005)

As driver distraction from in-vehicle devices increasingly becomes a concern on our roadways, researchers have searched for better scientific understanding of distraction along with better engineering tools to build less distracting devices. This paper presents a new system, Distract-R, that allows designers to rapidly prototype and evaluate new in-vehicle interfaces. The core engine of the system relies on a rigorous cognitive model of driver performance, which the system integrates with models of behavior on the prototyped interfaces to generate predictions of distraction. Distract-R allows a designer to prototype basic interfaces, demonstrate possible tasks on these interfaces, specify relevant driver characteristics and driving scenarios, and finally simulate, visualize, and analyze the resulting behavior as generated by the cognitive model. The paper includes two sample studies that demonstrate the system's ability to account for effects of input modality and driver age on performance.
Optimum Training Sequences for the Uplink of MIMO MC-CDMA Systems
Authors: W. Lee, B. Tau Sieskul, S. Kunaruttanapruk, S. Jitapunkul
Venue: Proceedings of the 3rd Annual Communication Networks and Services Research Conference (2005)

In wireless communication systems, the use of multiple antennas at both transmitter and receiver, called multiple-input multiple-output (MIMO) architecture, is one of the most promising techniques to improve spectral efficiency and performance communication links. This paper proposed a new scheme of training sequence transmission for estimating the time-varying channel in the MIMO MC-CDMA system. Such training sequences can be regarded as an optimal manipulation by mean of orthogonal design. The proposed scheme can support more number of users than the conventional scheme. The optimum training sequences reduce the complexity of the channel estimation at the compensation of a negligible performance degradation. The proposed estimator was evaluated by computer simulations to demonstrate the merits of proposed technique.
Fine-grain leakage optimization in SRAM based FPGAs
Authors: Somsubhra Mondal, Seda Ogrenci Memik
Venue: Proceedings of the 15th ACM Great Lakes symposium on VLSI (2005)

FPGAs are evolving at a rapid pace with improved performance and logic density. At the same time, trends in technology scaling makes leakage power a serious concern for designers. In this paper, we propose a hierarchical look-up table (LUT) structure for FPGAs to improve leakage power consumption. We present a detailed analysis on the number of inputs actually used by LUTs, and we observe that on an average 47% LUTs do not use one or more inputs. In the proposed hierarchical LUT structure depending on the number of inputs used by the LUTs we shut off certain SRAM cells and transistors associated with the unused LUT inputs. Based on this technique, for 180nm technology, we report an average savings of 22.94% (as high as 64.22%) in leakage power per LUT. The savings will be even greater for technologies as low as 90nm currently in use for FPGA production as well as for future technologies.
A New Transadmittance Type First-Order Allpass Filter Employing Single Third Generation Current Conveyor
Authors: Uğur Çam
Venue: Analog Integrated Circuits and Signal Processing (2005)

A novel transadmittance (TA) mode first-order all-pass filter configuration is proposed. The proposed circuit uses a third generation current conveyor (CCIII), three resistors and a grounded capacitor. The output of the filter exhibits high output impedance so that the synthesized filter can be cascaded without additional buffers. The theoretical results are verified with PSPICE simulations using a CMOS realization of CCIII.
Multi-valued dependencies in the presence of lists
Authors: Sven Hartmann, Sebastian Link
Venue: Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems (2004)

Multi-valued depdendencies (MVDs) are an important class of relational constraints. We axiomatise MVDs in data models that support nested list types. In order to capture different data models at a time, an abstract approach based on nested attributes is taken. The set of subattributes of some fixed nested attribute carries the structure of a co-Heyting algebra. This enables us to generalise significant features of MVDs from the relational data model to the presence of lists. It is shown that an MVD is satisfied by some instance exactly when this instance can be decomposed without loss of information. The full power of the algebraic framework allows to provide a sound and complete set of inference rules for the finite implication of MVDs in the context of lists. The presence of the list operator calls for a new inference rule which is not required in the relational data model. Further differences become apparant when the minimality of the inference rules is investigated. The extension of the relational theory of MVDs to the presence of lists allows to specify more real-world constraints and increases therefore the number of application domains.