ppxscal/embedding_network huggingface dataset:
Breaking Through the Clutter: Benefits of Advertisement Originality and Familiarity for Brand Attention and Memory
Authors: Rik Pieters, Luk Warlop, Michel Wedel
Venue: Management Science (2002)

Rising levels of advertising competition have made it increasingly difficult to attract and hold consumers' attention and to establish strong memory traces for the advertised brand. A common communication strategy to break through this competitive clutter is to increase ad originality. However, ad originality may have detrimental effects when consumers pay more attention to the ad at the expense of the advertised brand. Moreover, the positive effects of originality may quickly wane when the ad becomes familiar. Surprisingly, no research to date has examined such brand attention and memory effects of ad originality and familiarity. The current study aims to fill this void. We use a stochastic model of the influence that ad originality and familiarity have on consumers' eye fixations to the key elements of advertisements--brand, text, and pictorial--and how the information extracted during eye fixations promotes memory for the advertised brand. The model explicitly accounts for heterogeneity due to consumers and advertisements. Infrared eye tracking was applied to collect eye fixation data from 119 consumers who paged through two general-audience magazines containing 58 full-page advertisements. Memory for the advertised brands was assessed with an indirect memory task. The model was estimated using Markov Chain Monte Carlo (MCMC) methods. In support of our hypotheses, original advertisements drew more attention to the advertised brand. More importantly however, advertisements that were both original and familiar attracted the largest amount of attention to the advertised brand, which improved subsequent brand memory. In addition, original and familiar ads were found to promote brand memory directly. Implications of these findings for communication and media planning strategy are discussed.
Decentralized Management of Persistent Bandwidth Provision for Mobile Devices in Cellular Radio Networks
Authors: Michael Reinicke, Moritz Strasser
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 7 - Volume 7 (2004)

WLAN, GSM and UMTS are the most acquainted radio networks for digital telephony and data transfer and for this reason (business) applications arise rapidly. In contrast to wire networks (e.g. Ethernet), radio networks have strict restraints: because of their physical characteristics radio networks implicate a permanent contest about bandwidth; a static access point is sharing one frequency together with all mobile user devices connected. Thus a competition for the bandwidth naturally arises as the bottleneck bandwidth is available to all participants and cannot be extended unlimited in a fixed number of usable channels. The paper introduces an economic approach that balances the scarce quantity of bandwidth in a market system with the help of an internal payment system. This coordination of bandwidth can be implemented both by a central point -- like a stock market instance -- ordecentralized within the radio network cells. Research results, comparing central coordination to a decentralized organized subject to different network topologies and -parameters have shown that networks underlying high dynamic appearance of peers outperform the centralized mechanism by far. Furthermore it will be shown, that for the dispersion of bandwidth and the choice of the access point, market mechanisms can be mapped to radio networks and efficient allocations can be reached in comparison to previous techniques and central coordination.
Construction of the planar partition postal code map based on cadastral reGIStration
Authors: Friso Penninga, Edward Verbree, Wilko Quak, Peter van Oosterom
Venue: Proceedings of the 11th ACM international symposium on Advances in geographic information systems (2003)

Accurate postal code maps could play an important role within GIS as the postal code has the potential to link the address description of buildings and their location in a certain global reference system. This relationship is possible in both directions: address matching and geocoding. These operators demand a certain mechanism in translating an exact geometric position (i.e. WGS84 coordinate) into a location indication (town, street, house number) and vice versa. As most built-up parcels are provided with a postal code this indicator could be used as the linkage. This paper describes the procedure, based on the Dutch cadastral reGIStration, to obtain a reliable 6-position planar postal code map for the Netherlands. Problems with existing postal code maps, like intersecting of houses and arbitrary derived boundaries are avoided.For a planar coverage, non built-up parcels having no assigned postal code should be assigned a plausible postal code. Therefore special attention is given to infrastructural parcels. These parcels are divided at their skeleton first and then piecewise attached to their neighbor parcels. This new approach results in very reliable postal code maps, which are visually attractive too as infrastructure lines can be regognized. The procedure is generic and can be applied to other administrative parcel information as well.The algorithm is implemented using the Computational Geometry Algorithms Library (CGAL), and the possibilities and limitations of this library are addressed as well. The reliability of the derived planar postal code map is discussed and some results are shown by figures. A short overview of alternatives and improvements concludes this paper.
Assistive technology in computer science
Authors: Blaise W. Liffick
Venue: Proceedings of the 1st international symposium on Information and communication technologies (2003)

The purpose of this paper is to demonstrate how assistive technology can be incorporated into computer science as a valid method of demonstrating basic computer science principles, human-computer interaction methods, and social, legal, and ethical issues in computing.
A Feature Selection Framework for Text Filtering
Authors: Zhaohui Zheng, Rohini Srihari, Sargur Srihari
Venue: Proceedings of the Third IEEE International Conference on Data Mining (2003)

This paper presents a new framework for local featureselection in text filtering. In this framework, a feature setis constructed per category by first selecting a set of termshighly indicative of membership (positive set) and anotherset of terms highly indicative of non-membership (negativeset), and then combining these two sets. This feature selectionframework not only unifies several standard featureselection methods, but also facilitates the proposal of a newmethod that optimally combines the positive and negativesets. The experimental comparison between the proposedmethod and standard methods was conducted on six featureselection metrics: chi-square, correlation coefficient, oddsratio, GSS coefficient and two proposed variants of odds ratioand GSS coefficient: OR-square and GSS-square respectively.The results show that the proposed feature selectionmethod improves text filtering performance.
A service platform for on-line games
Authors: Debanjan Saha, Sambit Sahu, Anees Shaikh
Venue: Proceedings of the 2nd workshop on Network and system support for games (2003)

Providing a satisfying experience for players of on-line first-person and multiplayer role-playing games is greatly influenced by the distribution and scalability of the game server infrastructure. Deploying a large, dedicated server infrastructure to support a single game title, however, is an expensive approach that does not make the best use of available resources. In this work-in-progress report, we propose a shared, on-demand service platform for hosting on-line games based on grid technology. A standards-based grid infrastructure provides economies of scale and high availability, necessary prerequisites for a successful on-line gaming service. We give an overview of the service architecture, and a detailed description of a number of middleware services that comprise the game hosting platform. In addition, we describe existing standards in grid technology and show how standard grid toolkit services can be leveraged to realize a gaming grid.
Block-Enabled Memory Macros: Design Space Exploration and Application-Specific Tuning
Authors: Luca Benini, Alessandro Ivaldi, Alberto Macii, Enrico Macii
Venue: Proceedings of the conference on Design, automation and test in Europe - Volume 1 (2004)

In this paper, we propose a combined solution that allows us to customize the architecture of internally partitioned SRAM macros according to the given application be executed. Energy savings with respect to monolithic memory configurations are above 40%, without access time violation.
Repetitive Motion Analysis: Segmentation and Event Classification
Authors: ChunMei Lu, Nicola J. Ferrier
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2004)

Abstract--Acquisition, analysis, and classification of repetitive human motion for the assessment of postural stress is of central importance to ergonomics practitioners. We present a two-threshold, multidimensional segmentation algorithm to automatically decompose a complex motion into a sequence of simple linear dynamic models. No a priori assumptions were made about the number of models that comprise the full motion or about the duration of the task cycle. A compact motion representation is obtained for each segment using parameters of a damped harmonic dynamic model. Event classification was performed using cluster analysis with the model parameters as input. Experiments demonstrate the technique on complex motion.
Effect of moving boundaries on the vibrating elastic string
Authors: I-Shih Liu, M. A. Rincon
Venue: Applied Numerical Mathematics (2003)

A new derivation of a wave equation for small vibrations of elastic strings fastened at ends varying with time is presented. The model takes into account the change of length during the vibration and the nonlinear behavior of elastic strings in general. This model is a generalization of the Kirchhoff equation which contains a nonlinear term involving the displacement gradient. Numerical simulations of the model are based on finite difference approximations. Differences between linear and nonlinear aspects and the assumptions of numerical and theoretical analysis are briefly discussed and comparisons are made for linear and nonlinear elastic strings as well as the Kirchhoff model and the linear model without the term containing the displacement gradient.
Extending STI for demanding hard-real-time systems
Authors: Benjamin Welch, Shobhit Kanaujia, Adarsh Seetharam, Deepaksrivats Thirumalai, Alexander G. Dean
Venue: Proceedings of the 2003 international conference on Compilers, architecture and synthesis for embedded systems (2003)

Software thread integration (STI) is a compilation technique which enables the efficient use of an application's fine-grain idle time on generic processors without special hardware support. With STI, a primary function (with real-time requirements on specific instructions) is automatically interleaved with a secondary function to create a single implicitly multithreaded function which minimizes context switching and hence both improves performance and also offers very fine-grain concurrency.In this paper we extend STI techniques to address two challenges. First, we reduce response time for interrupts or other high-priority threads by introducing polling servers into integrated threads. Currently integrated threads disable interrupts, delaying all other work until their completion. Second, we enable integration with long host threads, expanding the domain of STI. With current techniques, if there are frequent interrupts, only host threads which can finish execution before the next interrupt can be integrated. We derive methods to evaluate the response time for threads in systems with and without these new integration methods.We demonstrate these concepts with the integration of various threads in a sample hard-real-time system on a highly-constrained microcontroller. We use an inexpensive 20 MHz AVR 8-bit microcontroller to generate monochrome NTSC video while servicing a high-speed (115.2 kbaud) serial communication link. We have built and tested this system and demonstrate graphics rendering speed-ups of 3.99x to 13.5x.
URU &mdash; On-line Identity Verification
Authors: C. J. Gahan
Venue: BT Technology Journal (2004)

Establishing and protecting identity is an issue that affects us all. In many everyday transactions, you have to prove that you are you. This paper describes URU, an automated on-line identity verification service based on a Web Services architecture and delivery model. It discusses how identity verification will move from today's model based on documentation, to a much more convenient, faster and lower cost Web Services model.Applications such as URU are evidence of the transition of Web Services from a set of much talked about standards into real-world deployment.
A Conversation with Peter Ford
Authors: Eric Allman
Venue: Queue (2003)

Instant messaging (IM) may represent our brave new world of communications, just as e-mail did a few short years ago. Many IM players are vying to establish the dominant standard in this new world, as well as introducing new applications to take advantage of all IM has to offer. Among them, hardly surprising, is Microsoft, which is moving toward the Session Initiation Protocol (SIP) as its protocol choice for IM.
On the Norms of Inverses of Pseudospectral Differentiation Matrices
Authors: David M. Sloan
Venue: SIAM Journal on Numerical Analysis (2004)

In this paper we give integral expressions for the elements of the inverses of second-order pseudospectral differentiation matrices. Simple upper bounds are given for the maximum norms of these inverse matrices when Chebyshev collocation points are used. Comment is made on the failure to obtain upper bounds that are uniform in the number of collocation points when the points are evenly spaced. We also give integral expressions for inverses of first-order Chebyshev pseudospectral differentiation matrices.
People in Our Software
Authors: John Richards, Jim Christensen
Venue: Queue (2004)

People are not well represented in today’s software. With the exception of IM (instant messaging) clients, today’s applications offer few clues that people are actually living beings. Static strings depict things associated with people like e-mail addresses, phone numbers, and home-page URLs. Applications also tend to show the same information about a person, no matter who is viewing it.
Experiences using statecharts for a system requirements specification
Authors: N. G. Leveson, M. Heimdahl, H. Hildreth, J. Reese, R. Ortega
Venue: Proceedings of the 6th international workshop on Software specification and design (1991)

This paper describes some lessons learned and issues raised while building a system requirements specification for a real aircraft collision avoidance system using statecharts. Some enhancements to statecharts were necessary to model the complete system and a few notational changes were made to improve reviewability.
The Practical Guide to Enterprise Architecture
Authors: James McGovern, Scott W. Ambler, Michael E. Stevens, James Linn, Elias K. Jo, Vikas Sharan
Venue:  (2003)

In A Practical Guide to Enterprise Architecture, six leading experts present indispensable technical, process, and business insight into every aspect of enterprise architecture. You'll find start-to-finish guidance for architecting effective system, software, and service-oriented architectures; using product lines to streamline enterprise software design; leveraging powerful agile modeling techniques; extending the Unified Process to the full software lifecycle; architecting presentation tiers and user experience; and driving the technical direction of the entire enterprise. For every working architect and every IT professional who wants to become one.
Multi-resolution modeling of large scale scientific simulation data
Authors: Chuck Baldwin, Ghaleb Abdulla, Terence Critchlow
Venue: Proceedings of the twelfth international conference on Information and knowledge management (2003)

To provide scientists and engineers with the ability to explore and analyze tera-scale size data-sets we are using a twofold approach. First, we model the data with the objective of creating a compressed yet manageable representation. Second, with that compressed representation, we provide the ability to query the resulting approximation in order to obtain approximate yet sufficient answers; a process called ad-hoc querying. This paper is concerned with a wavelet modeling technique that seeks to capture the important physical characteristics of the target scientific data. Our approach is driven by the compression, which is necessary for viable throughput, along with the end user requirements from the discovery process. Our work contrasts existing research which applies wavelets to range querying, change detection, and clustering problems by working directly with the wavelet decomposition of the data. The difference in this procedure is due primarily to the nature of the data and the requirements of the scientists and engineers. Our approach directly uses the wavelet coefficients of the data to compress as well as query. We describe how the wavelet decomposition is used to facilitate data compression and how queries are posed on the resulting compressed model. Results of this process will be shown for several problems of interest.
An easy-to-use toolkit for efficient Java bytecode translators
Authors: Shigeru Chiba, Muga Nishizawa
Venue: Proceedings of the 2nd international conference on Generative programming and component engineering (2003)

This paper presents our toolkit for developing a Java-bytecode translator. Bytecode translation is getting important in various domains such as generative programming and aspect-oriented programming. To help the users easily develop a translator, the design of our toolkit is based on the reflective architecture. However, the previous implementations of this architecture involved serious runtime penalties. To address this problem, our toolkit uses a custom compiler so that the runtime penalties are minimized. Since the previous version of our toolkit named <i>Javassist</i> has been presented in another paper, this paper focuses on this new compiler support for performance improvement. This feature was not included in the previous version.
Proceedings of the 12th international workshop on Real-time Ada
Venue: International Workshop on Real-time Ada Issues (2003)

We are pleased to dedicate this issue to the proceedings of the 12th International Real-Time Applications Workshop (IRTAW 12), which was held in Pousada Monte de Sta. Luzia, Viana do Castelo, Portugal from 15-19 September 2003. This workshop has provided real benefit to the Ada community by addressing issues to make the Ada language effective in achieving real-time requirements. There were 22 participants representing 9 countries. For those into real-time applications, these proceedings will be extremely valuable. Even if you are not, there are several sections that you might want to pay close attention. For example, a Session Summary on New Core Language Features will provide information on the direction ISO/IEC JTC1/SC22 WG9 is taking for the new real-time related features planned for the Ada 2005 Amendment to the Ada ISO language standard. Many of these features evolved from previous IRTAW meetings. SIGAda thanks the IRTAW for this important contribution and we are very happy to publish these proceedings.
On the Critical Value for &lsquo;Percolation&rsquo; of Minimum-Weight Trees in the Mean-Field Distance Model
Authors: David Aldous
Venue: Combinatorics, Probability and Computing (1998)

Consider the complete n-graph with independent exponential (mean n) edge-weights. Let M(c, n) be the maximal size of subtree for which the average edge-weight is at most c. It is shown that M(c, n) makes the transition from o(n) to &Omega;(n) around some critical value c(0), which can be specified in terms of a fixed point of a mapping on probability distributions.
Managing tradeoffs in the electronic age
Authors: A. Ben Wagner
Venue: Journal of the American Society for Information Science and Technology (2003)

An overview of the development of electronic resources over the past three decades is provided, discussing key features, disadvantages, and benefits of traditional on-line databases and CD-ROM and Web-based resources. This analysis of gains and losses as information resources have shifted to the Internet provides a basis for identifying key issues in the decision to shift collections and resources toward purely digital formats. Ownership of content, licensing terms, and the proliferation of user interfaces are especially important and still unresolved concerns.
Bibliomining for automated collection development in a digital library setting: using data mining to discover web-based scholarly research works
Authors: Scott Nicholson
Venue: Journal of the American Society for Information Science and Technology (2003)

This research creates an intelligent agent for automated collection development in a digital library setting. It uses a predictive model based on facets of each Web page to select scholarly works. The criteria came from the academic library selection literature, and a Delphi study was used to refine the list to 41 criteria. A Perl program was designed to analyze a Web page for each criterion and applied to a large collection of scholarly and nonscholarly Web pages. Bibliomining, or data mining for libraries, was then used to create different classification models. Four techniques were used: logistic regression, non-parametric discriminant analysis, classification trees, and neural networks. Accuracy and return were used to judge the effectiveness of each model on test datasets. In addition, a set of problematic pages that were difficult to classify because of their similarity to scholarly research was gathered and classified using the models. The resulting models could be used in the selection process to automatically create a digital library of Web-based scholarly research works. In addition, the technique can be extended to create a digital library of any type of structured electronic information.
Availability of protocol goals
Authors: Giampaolo Bella
Venue: Proceedings of the 2003 ACM symposium on Applied computing (2003)

A new principle for prudent design of security protocols is developed to extend and complement the existing ones. Called goal availability, the principle requires that a given protocol goal be confirmed by a formal guarantee that the principals can invoke in practice. In consequence, the guarantees must be based on assumptions that the principals are able to verify. Analysing known protocols in the light of the new principle highlights unknown features. for example, an established BAN-logic claim is undermined, and some weaknesses of a modern smart card protocol are discovered. Our findings support the general claim that checking a protocol against goal availability helps discover unspotted lacks of explicitness in the protocol messages. The protocol analyses reported here are all machine assisted, but goal availability serves for protocol analysis in general.