ppxscal/embedding_network huggingface dataset:
My agent as myself or another: effects on credibility and listening to advice
Authors: Ian Li, Jodi Forlizzi, Anind Dey, Sara Kiesler
Venue: Proceedings of the 2007 conference on Designing pleasurable products and interfaces (2007)

People consider other people who resemble them to be more persuasive. Users may consider embodied conversational agents, or ECAs, to be more persuasive if the agents resemble them. In an experimental study, we found that users rated the persuasiveness of agents that resemble them higher than other agents. However, actual advice-taking diverged from this pattern; when users created the agents, users changed their choices less when interacting with the agents that resembled them. We conducted a follow-up study and found that resemblance and self-esteem affect interactions with agents that resemble users. We discuss the use of self-report and behavioral data in evaluations of agent interfaces and how agents that resemble users might foster particular social interactions with a system. We suggest that agents that resemble users may be more persuasive in advising users about their actions and decisions.
Characterizing Software Architecture Changes: An Initial Study
Authors: Byron J. Williams, Jeffrey C. Carver
Venue: Proceedings of the First International Symposium on Empirical Software Engineering and Measurement (2007)

With today's ever increasing demands on software, developers must produce software that can be changed without the risk of degrading the software architecture. Degraded software architecture is problematic because it makes the system more prone to defects and increases the cost of making future changes. The effects of making changes to software can be difficult to measure. One way to address software changes is to characterize their causes and effects. This paper introduces an initial architecture change characterization scheme created to assist developers in measuring the impact of a change on the architecture of the system. It also presents an initial study conducted to gain insight into the validity of the scheme. The results of this study indicated a favorable view of the viability of the scheme by the subjects, and the scheme increased the ability of novice developers to assess and adequately estimate change effort.
Kernel Principal Component Analysis for Fuzzy Point Data Set
Authors: Li-Li Wei, Chong-Zhao Han
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 02 (2007)

Kernel principal component analysis (KPCA) has provided an extremely powerful approach to extracting nonlinear features via kernel trick, and it has been suggested for a number of applications. Whereas the nonlinearity can be allowed by the utilization of Mercer kernels, the standard KPCA could only process exact training samples which be treated uniformly and can't reflect prior information of data. However, in many real-world applications, each training data has different meanings and confidence degrees for population. In this paper, a new concept, called "fuzzy point data" which is defined by giving a fuzzy membership to each training sample, is proposed for helping us handle the confidence of data. We reformulate KPCA for fuzzy point data. Experimental results show our method could embody effects of different samples in constructing principal axes and supply a feasible method to control possible outliers.
Simulation Experiments for Satellite Multi-axis Pointing with Fuzzy Control
Authors: Yingying Liu, Jun Zhou
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 04 (2007)

The multi-body satellites with flexible solar panels and antennas are taken as practical background, a multi-axis pointing control scheme is studied for body attitude and antenna pointing. A simple fuzzy control algorithm is designed according to the "wheel-thruster" actuator mode, considering control precision and gas consumption. Simulation experiments for the multi-axis pointing control are successfully carried out on an air bearing testbed. The experiments results verified that the control system is effective for multi-axis pointing task, and the fuzzy control algorithm is feasible in real time system. The precision of the multi-axis pointing system is high and the consumption of gas is low
Statement-Level Cohesion Metrics and their Visualization
Authors: Jens Krinke
Venue: Proceedings of the Seventh IEEE International Working Conference on Source Code Analysis and Manipulation (2007)

Slice-based metrics for cohesion have been defined and examined for years. However, if a module with low cohesion has been identified, the metrics cannot help the maintainer to restructure the module to improve the cohesion. This work presents statement-level cohesion metrics based on slices and chops. When visualized, the statement-level cohesion metrics can show which parts of a module have a low cohesion and thus help the maintainer to identify the parts that should be restructured.
R-MAC: An Energy-Efficient MAC Protocol for Underwater Sensor Networks
Authors: Peng Xie, Jun-Hong Cui
Venue: Proceedings of the International Conference on Wireless Algorithms,Systems and Applications (2007)

Underwater sensor networks are significantly different from terrestrial sensor networks in that sound is mainly used as the communication medium. The long propagation delay and limited bandwidth of acoustic channels make the existing MAC protocols designed for radio networks either unpractical or not energy efficient for underwater sensor networks. In this paper, we propose a reservation-based MAC protocol, called R-MAC. The major design goals of R-MAC are energy efficiency and fairness. R-MAC schedules the transmissions of control packets and data packets to avoid data packet collision completely. The scheduling algorithms not only save energy but also solve the exposed terminal problem inherited in RTS/CTS-based protocols. Furthermore, the scheduling algorithms allow nodes in the network to select their own schedules, thus loosening the synchronization requirement the protocol. Additionally, R-MAC supports fairness. By simulations, we show that R-MAC is an energy efficient and fair MAC solution for underwater sensor networks.
Shared Logic Realizations of Dynamically Self-Checked and Fault-Tolerant Logic
Authors: M. Y. Osman
Venue: IEEE Transactions on Computers (1973)

Dynamically self-checked or fault-tolerant realizations of switching functions and sequential machines are proposed under a fault model that permits arbitrary logic faults in a single-logic module, where the modules are explicitly defined. These realizations permit considerable logic sharing, organized around an (n, m, r)-basis for decomposing switching functions. The logic sharing permits more economical realizations than can be obtained using classical parity and triple-modular redundancy schemes for obtaining logic circuits with the corresponding property.
Astrolabe: a Grid Operating Environment with Full-fledged Usability
Authors: Hailue Lin, Kun Chen, Xiaohui Yan
Venue: Proceedings of the Sixth International Conference on Grid and Cooperative Computing (2007)

Based on a comprehensive analysis of existing grid portals and problem-solving environments, Astrolabe, a feature-rich grid operating environment built on a finetuned client/server architecture is presented in this paper. In Astrolabe, a dynamic portlet container is deployed at the client side to provide portlets with more powerful runtime capabilities such as rich interfaces, local resource accessability and offline usage, comparing to the JSR-168 specification. A workflow designer is built upon the portlet container to provide integrated workflow modeling capability. Moreover, server-side components are also employed to enable portability and collaboration among users. The main contribution of this paper is bringing the aforementioned features as a full package, which could improve the usability of current grid computing environments. Eclipse RCP is utilized for the implementation of Astrolabe to leverage the state of the art of rich client technologies.
Cognitive vision: The case for embodied perception
Authors: David Vernon
Venue: Image and Vision Computing (2008)

This paper considers arguments for the necessity of embodiment in cognitive vision systems. We begin by delineating the scope of cognitive vision, and follow this by a survey of the various approaches that can be taken to the realization of artificial cognitive vision systems, focussing on cognitive aspects. These range from the cognitivist symbolic representational paradigm, through connectionist systems and self-organizing dynamical systems, to the enactive cognition paradigm. We then consider various arguments for embodiment, beginning with paradigm-specific cases, and concluding with a paradigm-independent argument for embodied perception and cognition. We explore briefly different forms of embodiment and their relevance to the foregoing viewpoints. We highlight some of the key problems associated with embodied cognitive vision, including the phylogeny/ontogeny trade-off in artificial systems and the developmental limitations imposed by real-time environmental coupling. Finally, we conclude by considering some aspects of natural cognitive systems to see how they can provide insights to help in addressing these problems.
On the Consecutive Retrieval Property in File Organization
Authors: A. Waksman
Venue: IEEE Transactions on Computers (1974)

The consecutive retrieval (CR) property has been defined as the property of a query that can be answered by the retrieval of consecutive records in a file. In this correspondence we add some observations about boundary conditions to Gosh's study of the CR property.
ReUML: a UML Profile for Modeling and Verification of Reactive Systems
Authors: S. Fatemeh Alavizaedh, Alireza Hashemi Nekoo, Marjan sirjani
Venue: Proceedings of the International Conference on Software Engineering Advances (2007)

The Unified Modeling Language, has become effectively the standard modeling language for analysis and design of software systems. However, despite achievements in defining semi-formal semantics, with a combination of OCL constraints and textual descriptions of the UML semantics, UML is still an informal language. This paper introduces a tool for developing correct models of distributed and reactive systems using UML and Rebeca. Rebeca is an actorbased modeling language supported by a formal verification tool. This approach can bridge the gap between software development and formal verification by allowing users to develop their systems using UML and yet getting advantage of formal verification support of Rebeca tools and theory. In this way, we combine two separate approaches to modeling by adding verification step to software development lifecycle. Furthermore, this can make a contribution to defining rigorous semantics for UML diagrams and to provide tool support for verification of these diagrams.
Improved BSS Based Schemes for Active Steganalysis
Authors: Bo Xu, Zhenbao Zhang, Jiazhen Wang, Xiaoqin Liu
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 03 (2007)

Two novel active steganalysis schemes which only use one copy of stego image are presented in this paper. We view active steganalysis as blind sources separation (BSS) problem and can be solved with Independent Component Analysis (ICA) algorithm under the assumption that embedded secret message is an independent, identically distributed (i.i.d) random sequence and independent to cover image. With only one copy of stego image we firstly adopt the maximum a posteriori (MAP) estimator to obtain an estimate of cover image. The first scheme views this estimated version as another stego image. The second scheme generates another two signals with the estimated version. All the three signals are as input signals of ICA algorithm. The two schemes overcome the unreasonable constraint of Chandramouli's method. Experiment results show that the proposed schemes achieve acceptable performance and improve the performance with larger message length.
An Adaptive Probability Access Mechanism for Wireless Sensor Network
Authors: Wei Liang, Haibin Yu, Chang Che
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 03 (2007)

Aiming at large-scale Wireless Sensor Network(WSN) whose main communication mode is broadcast, the main factors restricting access performance of contention-based Media Access Control(MAC) protocols were analyzed in this paper. Accordingly, a kind of adaptive probability Access mechanism was put forward, through which contention-based MAC protocols can transmit acknowledgement packet according to acknowledgement probability in the broadcast communication mode and adaptively adjust the acknowledgement probability on the basis of network status in the transmission window. Plentiful simulation results show that the MAC protocol based on the proposed adaptive probability acknowledgement mechanism has better access control performance and energy consumption performance.
User-assisted query translation for interactive cross-language information retrieval
Authors: Douglas W. Oard, Daqing He, Jianqiang Wang
Venue: Information Processing and Management: an International Journal (2008)

Interactive Cross-Language Information Retrieval (CLIR), a process in which searcher and system collaborate to find documents that satisfy an information need regardless of the language in which those documents are written, calls for designs in which synergies between searcher and system can be leveraged so that the strengths of one can cover weaknesses of the other. This paper describes an approach that employs user-assisted query translation to help searchers better understand the system's operation. Supporting interaction and interface designs are introduced, and results from three user studies are presented. The results indicate that experienced searchers presented with this new system evolve new search strategies that make effective use of the new capabilities, that they achieve retrieval effectiveness comparable to results obtained using fully automatic techniques, and that reported satisfaction with support for cross-language searching increased. The paper concludes with a description of a freely available interactive CLIR system that incorporates lessons learned from this research.
Multi-path-based Distributed TCP Caching for Wireless Sensor Networks
Authors: Yuhua Liu, Hao Huang, Kaihua Xu
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 03 (2007)

The paper investigates some important transport layer algorithms for wireless sensor networks. On the basis of the single-path-based distributed TCP caching, which work badly when some node on the path be down, adopt multi-path routing on the network layer and distributed TCP caching on the transport layer to enhance transport reliability. From the simulation results, it improves overall performance in term of end-to-end transport delay comparing with the original DTC algorithm and loads are distributed among the intermediate nodes. And then address some open issues as the research prospects.
Local Binary Patterns on Hexagonal Image Structure
Authors: Xiangjian He, Jianmin Li, Wenjing Jia, Qiang Wu, Tom Hintz
Venue: Proceedings of the 7th IEEE International Conference on Computer and Information Technology (2007)

Local Binary Pattern (LBP) was designed and widely used for efficient texture classification. It has been used for face recognition and has potential applications in many other research areas such as human detection. LBP provides a simple and effective way to represent patterns. Uniform LBPs play an important role for LBP-based pattern /object recognition as they include majority of LBPs. In this paper, we present LBP codes on hexagonal image structure. We show that LBPs defined on hexagonal structure have higher percentages of uniform LBPs that will lead to a more efficient and accurate recognition scheme for image classification.
An Adaptive Stable Link Selection Algorithm for Mobile Ad Hoc Networks
Authors: Hui Zhang, Yu-ning Dong
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 01 (2007)

An adaptive strategy based stable link selection algorithm is proposed in this paper, in which the stable neighbor metric and local movement metric are defined. On the basis, the stability probability of each link is computed adaptively to find the most stable link or route in a route discovery. The simulation results show that our algorithm can effectively adapt to the network conditions, and outperforms the longevity factor based algorithm as well as the residual lifetime based algorithm in selecting stable links.
Parallel Compressors
Authors: D. D. Gajski
Venue: IEEE Transactions on Computers (1980)

A subclass of generalized parallel counters, called parallel compressors, is introduced in this correspondence. Under present-day packaging technology, parallel compressors with their higher compression ratio and fewer input/output pins are more efficient in multiple operand addition and multiplication than parallel counters. Cost and time bounds are obtained for schemes using parallel compressors for reduction of N summands to m summands. Furthermore, a method for synthesizing large parallel counters using only one type of parallel compressor is given.
Implementation and Evaluation of Specific Data-Intensive Scientific Applications on the FT64 Stream Processor
Authors: Yu Deng, Xuejun Yang, Xiaobo Yan, Ying Zhang, Jing Du
Venue: Proceedings of the 7th IEEE International Conference on Computer and Information Technology (2007)

The stream architecture is one of the emerging architectures that address the memory-wall problem of modern processors. While it is successful in the domain of multimedia, its efficiency to scientific applications is increasingly concerned. This paper implements the stream programs for some data- intensive scientific programs and evaluates the performance on the FT64 stream processor, which is the first implementation of a 64-bit stream processor for scientific computing. The stream programs are optimized against the memory hierarchy of FT64 to minimize the expensive off-chip memory transfers. The preliminary results show that FT64 is efficient for these applications.
Joint pricing and replenishment decisions for deteriorating items with lot-size and time-dependent purchasing cost under credit period
Authors: Yu-Chung Tsao, Gwo-Ji Sheen
Venue: International Journal of Systems Science (2007)

In the real world, the purchasing cost would normally decrease as the replenishment lot-size becomes larger. In other words, the quantity discount effect applies. The purchasing cost may also decrease with the passage of time, for example if the supplier has made effective improvements in their production efficiency, in other words due to the effect of the learning curve. In this article we discuss a purchasing cost pattern which considers these phenomena: i.e., lot-size and time-dependence. The objective of the model is to make decisions related to the pricing and replenishment of deteriorating items over a finite time horizon, given variable purchasing cost and credit period. We provide the properties and develop algorithms for solving the problems described. Also, we discuss the influence of the variable purchasing cost, the length of the credit period, the rate of deterioration, etc., on the retailer behavior.
A Novel Approach to Multi-document Summarization
Authors: Li-Qing Qiu, Bin Pang, Sai-Qun Lin, Peng Chen
Venue: Proceedings of the 18th International Conference on Database and Expert Systems Applications (2007)

In the paper we have studied the application of document sets categorization and different features combination in the summarization. The most important work is that we implement an improved extractive summarizer, which analyzes the document sets and decides the categories of the documents using different summarization strategies. The novel summarizer with categorization has confirmed better than summarizer without categorization.
Understanding and Building Spreadsheet Tools
Authors: Martin Erwig, Robin Abraham
Venue: Proceedings of the IEEE Symposium on Visual Languages and Human-Centric Computing (2007)

Spreadsheets are among the most widely used programming systems. Unfortunately, there is a high incidence of errors within spreadsheets that are employed for a wide variety of computations. Some of these errors have a huge impact on individuals and organizations. As part of our research on spreadsheets, we have developed several approaches that are targeted at helping end-user programmers prevent, detect, and correct faults within their spreadsheets.
Mathpad: A Fuzzy Logic-Based Recognition System for Handwritten Mathematics
Authors: J. Fitzgerald, F. Geiselbrechtinger, T. Kechadi
Venue: Proceedings of the Ninth International Conference on Document Analysis and Recognition - Volume 02 (2007)

Currently available methods for inputting mathematical expressions are counter-intuitive and require knowledge of keywords. In this paper we present a recognition system for handwritten mathematics, with the goal of enabling users to enter mathematics in the customary fashion. Our approach centres around the use of fuzzy logic, with fuzzy rules being used to extract features, classify symbols, and assess spa- tial relationships. Taking advantage of the fuzzy informa- tion available, our structural analysis algorithm weighs up which candidate symbol identities and spatial relationships are worth exploring, and maintains numerous possible ex- pression trees. The most likely tree is ultimately chosen as the result. The system has achieved high recognition rates on a database of expressions written by multiple users.
Simplified patterns for extracting the isosurfaces of solid objects
Authors: Shi Hua Cui, Jie Liu
Venue: Image and Vision Computing (2008)

By moving the positions of isosurface vertice from the cube edge interpolation points as in the standard marching cubes (MC), to the centers of the corresponding occupied cube vertices, this paper presents a set of much simpler triangulation patterns for isosurface extraction. Compared with the MC algorithm, the new design gives much fewer triangles, less extraction time, and exhibits remarkable resistance against dot noises, and the generated isosurface somewhat retains the object sharpness on convex surfaces. Among the whole 256 cases, the MC algorithm utilizes 254 for triangulation, while the present algorithm considers only 178. On the assumption that each case occurs once, 820 triangles will be extracted in the standard MC algorithm, while the present algorithm creates only 308 triangles. Extraction results using solid shapes and a real anatomical dataset demonstrate the considerable reduction in vertices, edges, triangles, and extracting time via the present patterns, with comparable rendering quality with the MC approach. And extraction experiments on 2 noisy datasets further verified the strong resistance to dot noise of the present algorithm.