ppxscal/embedding_network huggingface dataset:
Context-aware system for proactive personalized service based on context history
Authors: Jongyi Hong, Eui-Ho Suh, Junyoung Kim, SuYeon Kim
Venue: Expert Systems with Applications: An International Journal (2009)

Predicting the preferences of users and providing the personalized services or products based on their preferences are the important issues. However, the research considering users' preferences on context-aware computing is a relatively insufficient research field. Hence, this paper aims to propose an agent-based framework for providing the personalized services using context history on context-aware computing. Based on the proposed framework, we implement a prototype system to show the feasibility of the framework. Previous researches require that the users input their preference manually, but this research provides the personalized services extracting the relationship between users' profile and services under the same context automatically.
An information system for developing information systems
Authors: Bruce I. Blum
Venue: Proceedings of the May 16-19, 1983, national computer conference (1983)

This paper considers a paradigm for the development of software through the use of a complete, integrated-design database. A prototype information system for the implementation of information management systems is then described. This tool manages the requirement definitions, the process and data flow, and all design and operational documentation. Using a relational-data model and program specifications, it generates programs in a selected target language. The results of two years' production use are presented, and the potential for transfer of the concept is examined.
An introduction to IBM general business simulation environment
Authors: Wei Wang, Jin Dong, Hongwei Ding, Changrui Ren, Minmin Qiu, Young M. Lee, Feng Cheng
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

IBM General Business Simulation Environment (GBSE) is a supply chain simulation tool developed by IBM China Research Lab. It can capture supply chain dynamics with finest level of granularity and provides great insights to a supply chain's real operations. GBSE is designed for tactical level decision making; it is proper for supply chain what-if analysis and risk analysis. GBSE implements multiple supply chain processes to considerable details, such as order handling process, inventory control process, manufacturing process, transportation process, procurement process, and planning. The environment is created as a desktop software tool based on Eclipse platform. The backbone framework consists of Presentation Layer, Controller Layer, Service Layer, and Data Layer.
Pluggable grid services
Authors: Joao Luis Sobral
Venue: Proceedings of the 8th IEEE/ACM International Conference on Grid Computing (2007)

This paper introduces a new concept of pluggable grid service, that provides seamless access to computational grids, based on aspect-oriented techniques. Pluggable grid services avoid explicit calls to grid services in scientific codes, localize grid-specific concerns into well defined modules and can be (un)plugged from scientific codes. Domain specific code becomes oblivious of grid issues, allowing scientists to concentrate on domain specific issues, and to manage grid issues by composing grid-specific modules. This paper presents a collection of pluggable grid services that illustrates the idea and shows how pluggable grid services can grid-enable a skeleton framework.
Envelopes and tubular splines
Authors: Marco Paluszny, Francisco Tovar
Venue: Mathematics and Computers in Simulation (2009)

Envelopes of monoparametric families of spheres determine canal surfaces. In the particular case of a quadratic family of spheres the envelope is an algebraic surface of degree four that is composed of circles. We are interested in the construction of smooth tubular splines with pieces of envelopes of quadratic families of spheres. We present a scheme for the construction of a tubular spline that interpolates a sequence of circles in 3D. We control the shape near each circle by prescribing a sphere that contains it and is tangent to the spline. We offer further shape handles for local control through weights that are assigned to the controlling spheres.
Multi-site Software Engineering Ontology Instantiations Management Using Reputation Based Decision Making
Authors: Pornpit Wongthongtham, Farookh Khadeer Hussain, Elizabeth Chang, Tharam S. Dillon
Venue: Advances in Web Semantics I: Ontologies, Web Services and Applied Semantic Web (2008)

In this paper we explore the development of systems for software engineering ontology instantiations management in the methodology for multi-site distributed software development. Ultimately the systems facilitate collaboration of teams in multi-site distributed software development. In multi-site distributed environment, team members in the software engineering projects have naturally an interaction with each other and share lots of project data/agreement amongst themselves. Since they are not always residing at the same place and face-to-face meetings hardly happen, there is a need for methodology and tools that facilitate effective communication for efficient collaboration. Whist multi-site distributed teams collaborate, there are a lot of shared project data updated or created. In a large volume of project data, systematic management is of importance. Software engineering knowledge is represented in the software engineering ontology whose instantiations, which are undergoing evolution, need a good management system. Software engineering ontology instantiations signify project information which is shared and has evolved to reflect project development, changes in the software requirements or in the design process, to incorporate additional functionality to systems or to allow incremental improvement, etc.
The reflective practitioner: in creation of PEGASYS
Authors: Sarah L. Moss, Ernest E. Edmonds
Venue: Proceedings of the 20th Australasian Conference on Computer-Human Interaction: Designing for Habitus and Habitat (2008)

This paper discusses the framework of a presence-generating art system (PEGASYS) in development as part of practice-based research. The interactive audio-visual panoramic computer-based system provides engagement with a natural terrain, incorporating site-specific performance and augmented characters made possible through the design, production and implementation of a tetradecagon (14 sided) camera plate. A gaze-based interface facilitates a biotechnological interaction that utilizes our ability to see in a human-computer orientation. The co-joining of eye-gaze technology with human strengths produces an outcome that facilitates engagements that can be deeply rewarding, embedding participants in new relationships with remote natural habitats.
Memory allocation for embedded systems with a compile-time-unknown scratch-pad size
Authors: Nghi Nguyen, Angel Dominguez, Rajeev Barua
Venue: ACM Transactions on Embedded Computing Systems (TECS) (2009)

This article presents the first memory allocation scheme for embedded systems having a scratch-pad memory whose size is unknown at compile time. A scratch-pad memory (SPM) is a fast compiler-managed SRAM that replaces the hardware-managed cache. All existing memory allocation schemes for SPM require the SPM size to be known at compile time. Unfortunately, because of this constraint, the resulting executable is tied to that size of SPM and is not portable to other processor implementations having a different SPM size. Size-portable code is valuable when programs are downloaded during deployment either via a network or portable media. Code downloads are used for fixing bugs or for enhancing functionality. The presence of different SPM sizes in different devices is common because of the evolution in VLSI technology across years. The result is that SPM cannot be used in such situations with downloaded codes. To overcome this limitation, our work presents a compiler method whose resulting executable is portable across SPMs of any size. Our technique is to employ a customized installer software, which decides the SPM allocation just before the program's first run, since the SPM size can be discovered at that time. The installer then, based on the decided allocation, modifies the program executable accordingly. The resulting executable places frequently used objects in SPM, considering both code and data for placement. To keep the overhead low, much of the preprocessing for the allocation is done at compile time. Results show that our benchmarks average a 41&percnt; speedup versus an all-DRAM allocation, while the optimal static allocation scheme, which knows the SPM size at compile time and is thus an unachievable upper-bound and is only slightly faster (45&percnt; faster than all-DRAM). Results also show that the overhead from our customized installer averages about 1.5&percnt; in code size, 2&percnt; in runtime, and 3&percnt; in compile time for our benchmarks.
A framework for event composition in distributed systems
Authors: Peter R. Pietzuch, Brian Shand, Jean Bacon
Venue: Proceedings of the ACM/IFIP/USENIX 2003 International Conference on Middleware (2003)

For large-scale distributed applications such as internet-wide or ubiquitous systems, event-based communication is an effective messaging mechanism between components. In order to handle the large volume of events in such systems, composite event detection enables application components to express interest in the occurrence of complex patterns of events. In this paper, we introduce a general composite event detection framework that can be added on top of existing middleware architectures -- as demonstrated in our implementation over JMS. We argue that the framework is flexible, expressive, and easy to implement. Based on finite state automata extended with a rich time model and support for parameterisation, it provides a decomposable core language for composite event specification, so that composite event detection can be distributed throughout the system. We discuss the issues associated with automatic distribution of composite event expressions. Finally, tests of our composite event system over JMS show reduced bandwidth consumption and a low notification delay for composite events.
Tangible augmented reality
Authors: Mark Billinghurst, Hirokazu Kato, Ivan Poupyrev
Venue: ACM SIGGRAPH ASIA 2008 courses (2008)

This paper advocates a new metaphor for designing three-dimensional Augmented Reality (AR) applications, Tangible Augmented Reality (Tangible AR). Tangible AR interfaces combine the enhanced display possibilities of AR with the intuitive manipulation and interaction of physical objects or Tangible User Interfaces. We define what Tangible AR interfaces are, present some design guidelines and prototype interfaces based on these guidelines. Experiences with these interfaces show that the Tangible AR metaphor supports seamless interaction between the real and virtual worlds, and provides a range of natural interactions that are difficult to find in other AR interfaces.
Algebraic transformation of differential characteristic decompositions from one ranking to another
Authors: Oleg Golubitsky, Marina Kondratieva, Alexey Ovchinnikov
Venue: Journal of Symbolic Computation (2009)

We propose an algorithm for transforming a characteristic decomposition of a radical differential ideal from one ranking into another. The algorithm is based on a new bound: we show that, in the ordinary case, for any ranking, the order of each element of the canonical characteristic set of a characterizable differential ideal is bounded by the order of the ideal. Applying this bound, the algorithm determines the number of times one needs to differentiate the given differential polynomials, so that a characteristic decomposition w.r.t. the target ranking could be computed by a purely algebraic algorithm (that is, without further differentiations). We also propose a factorization-free algorithm for computing the canonical characteristic set of a characterizable differential ideal represented as a radical ideal by a set of generators. This algorithm is not restricted to the ordinary case and is applicable for an arbitrary ranking.
Mining Research Communities in Bibliographical Data
Authors: Osmar R. Zaïane, Jiyang Chen, Randy Goebel
Venue: Advances in Web Mining and Web Usage Analysis: 9th International Workshop on Knowledge Discovery on the Web, WebKDD 2007, and 1st International Workshop on Social Networks Analysis, SNA-KDD 2007, San Jose, CA, USA, August 12-15, 2007. Revised Papers (2009)

Extracting information from very large collections of structured, semi-structured or even unstructured data can be a considerable challenge when much of the hidden information is implicit within relationships among entities in the data. Social networks are such data collections in which relationships play a vital role in the knowledge these networks can convey. A bibliographic database is an essential tool for the research community, yet finding and making use of relationships comprised within such a social network is difficult. In this paper we introduce DBconnect, a prototype that exploits the social network coded within the DBLP database by drawing on a new random walk approach to reveal interesting knowledge about the research community and even recommend collaborations.
Assigning discounts in a marketing campaign by using reinforcement learning and neural networks
Authors: Gabriel Gómez-Pérez, José D. Martín-Guerrero, Emilio Soria-Olivas, Emili Balaguer-Ballester, Alberto Palomares, Nicolás Casariego
Venue: Expert Systems with Applications: An International Journal (2009)

In this work, RL is used to find an optimal policy for a marketing campaign. Data show a complex characterization of state and action spaces. Two approaches are proposed to circumvent this problem. The first approach is based on the self-organizing map (SOM), which is used to aggregate states. The second approach uses a multilayer perceptron (MLP) to carry out a regression of the action-value function. The results indicate that both approaches can improve a targeted marketing campaign. Moreover, the SOM approach allows an intuitive interpretation of the results, and the MLP approach yields robust results with generalization capabilities.
Continuous Noninvasive Pulse Transit Time Measurement for Psycho-physiological Stress Monitoring
Authors: Stefan Hey, Adnene Gharbi, Birte von Haaren, Katrin Walter, Nils König, Simone Löffler
Venue: Proceedings of the 2009 International Conference on eHealth, Telemedicine, and Social Medicine (2009)

Stress is one of the most common reasons for a number of serious diseases. For the prevention and treatment of stress, a psycho-physiological monitoring system for stress measurement is needed. Because of the multifarious influences of stress on the physiological response of the body, a stress measurement system has to take into account as many parameters as possible. The pulse transit time (PTT), which is determined by measuring the ECG and the pulse wave at for example a finger, gives comprehensive information about the cardiovascular system. In a study we investigate the correlation between the PTT and the stress induced by a psychological experiment. We found out that there is a strong correlation and that PTT is an appropriate parameter for stress measurement.
Thermal Design Space Exploration of 3D Die Stacked Multi-core Processors Using Geospatial-Based Predictive Models
Authors: Chang-Burm Cho, Wangyuan Zhang, Tao Li
Venue: Proceedings of the 2009 SPEC Benchmark Workshop on Computer Performance Evaluation and Benchmarking (2009)

This paper presents novel 2D geospatial-based predictive models for exploring the complex thermal spatial behavior of three-dimensional (3D) die stacked multi-core processors at the early design stage. Unlike other analytical techniques, our predictive models can forecast the location, size and temperature of thermal hotspots. We evaluate the efficiency of using the models for predicting within-die and cross-dies thermal spatial characteristics of 3D multi-core architectures with widely varied design choices (e.g. microarchitecture, floor-plan and packaging). Our results show the models achieve high accuracy while maintaining low complexity and computation overhead.
The Weierstrass Canonical Form of a Regular Matrix Pencil: Numerical Issues and Computational Techniques
Authors: Grigorios Kalogeropoulos, Marilena Mitrouli, Athanasios Pantelous, Dimitrios Triantafyllou
Venue: Numerical Analysis and Its Applications: 4th International Conference, NAA 2008, Lozenetz, Bulgaria, June 16-20, 2008. Revised Selected Papers (2009)

In the present paper, we study the derivation of the Weierstrass Canonical Form (WCF) of a regular matrix pencil. In order to compute the WCF, we use two important computational tools: a) the QZ algorithm to specify the required root range of the pencil and b) the updating technique to compute the index of annihilation. The proposed updating technique takes advantages of the already computed rank of the sequences of matrices that appears during our procedure reducing significantly the required floating-point operations.The algorithm is implemented in a numerical stable manner, giving efficient results. Error analysis and the required complexity of the algorithm are included.
SITUMET: Situation-Based Meteorological Services
Authors: Michael Klafft, Daniela Knorr, Ulrich Meissen, Manfred Spatzierer, Agnès Voisard
Venue: Proceedings of the 2008 The Second International Conference on Next Generation Mobile Applications, Services, and Technologies (2008)

Recent improvements in the field of meteorological forecasting now allow for a fine-granular and localized prediction of meteorological parameters, thus opening up new opportunities for situation-based and mobile meteorological services. In this paper, techniques for the fine-granular prediction of local weather conditions are presented, together with an overview of already existing and prospective situation-based meteorological services. Current challenges in service generation are discussed and a platform is proposed that supports flexible and adaptive composition of situation-based meteorological services.
An improved watermarking technique for multi-user, multi-right environments
Authors: Hoi Ting Poon, Ali Miri, Jiying Zhao
Venue: Multimedia Tools and Applications (2009)

In digital rights management, there are many instances where there is more than one user involved, with each user having different level of rights. In this paper, we develop a novel approach to the multi-user, multi-right problem, where users are tied to various rights in an arbitrary access structure. Our approach is applicable to all kinds of media and can be used with any watermarking algorithm, provided that keys are used to generate the watermarks. This flexibility also enables it to benefit from future progress in the development of watermarking algorithms, in particular that of multiple watermarking. The proposed technique uses the generalized secret sharing scheme of Benaloh and Leichter, and builds on the earlier work of Guo on the joint ownership problem. By noting that the number of rights is likely much smaller than the number of users in most practical situations, and by generating the watermarks independently, the proposed approach achieves greater fidelity and detection capability than Guo's schemes while remaining secure against colluding users.
LiveCompare: grocery bargain hunting through participatory sensing
Authors: Linda Deng, Landon P. Cox
Venue: Proceedings of the 10th workshop on Mobile Computing Systems and Applications (2009)

Many consumers are misled into paying high prices due to the search costs associated with attaining price information [16]. The popularity of bargain-hunting web sites like Slickdeals.net, which boasts 2.5 million visitors per month, hints that many shoppers are indeed in search of tools to help them save money. We present LiveCompare, a system that leverages the ubiquity of mobile camera phones to allow for grocery bargain hunting through participatory sensing. We utilize two-dimensional barcode decoding to automatically identify grocery products, as well as localization techniques to automatically pinpoint store locations. We show that an incentive scheme is inherently ingrained into our query/response protocol, and we suggest self-regulating mechanisms for preserving data integrity. As a result, we demonstrate that money-saving price comparisons can be conducted among brick and mortar grocery stores without the explicit cooperation of the stores.
State persistence: a property for guiding test generation
Authors: Irith Pomeranz, Sudhakar M. Reddy
Venue: Proceedings of the 19th ACM Great Lakes symposium on VLSI (2009)

We study a property of circuit states referred to as persistence. The persistence pi(s) of a state s is the number of next-state variables whose values are specified (0 or 1) when a fully-unspecified primary input vector is applied to the circuit in state s. When a next-state variable Yi is specified under a fully-unspecified primary input vector, there are faults in the input cone of Yi that cannot be detected on Yi. We demonstrate through experimental results that when lower-persistence states are used as scan-in states, the resulting tests detect larger numbers of faults. Low-persistence states are thus preferable as scan-in states during test generation. We also discuss the computation of low-persistence states.
Sensitivity analysis of spatial models
Authors: Linda Lilburne, Stefano Tarantola
Venue: International Journal of Geographical Information Science (2009)

Sensitivity analysis is the study of how uncertainty in model predictions is determined by uncertainty in model inputs. A global sensitivity analysis considers the potential effects from the simultaneous variation of model inputs over their finite range of uncertainty. A number of techniques are available to carry out global sensitivity analysis from a set of Monte Carlo simulations; some techniques are more efficient than others, depending on the strategy used to sample the uncertainty of model inputs and on the formulae employed for estimating sensitivity measures. The most common approaches are summarised in this paper by focusing on the limitations of each in the context of a sensitivity analysis of a spatial model. A novel approach for undertaking a spatial sensitivity analysis (based on the method of Sobol' and its related improvements) is proposed and tested. This method makes no assumptions about the model and enables the analysis of spatially distributed, uncertain inputs. The proposed approach is illustrated with a simple test model and a groundwater contaminant model.
Pivot: Automatically Offering Information and Services to Real-World Shoppers
Authors: Nathan Nichols, Kristian J. Hammond, Larry Birnbaum, Lisa Gandy
Venue: Proceedings of the 2008 The Second International Conference on Next Generation Mobile Applications, Services, and Technologies (2008)

Shoppers with an internet-enabled computer have a wealth of product information available to them. By browsing to a variety of websites, users can conduct searches and compare prices, read reviews, and learn more about a product. These sites are pivot points for a user; once they are at Amazon.com's landing page, for example, they can navigate outwards to a million different products. The idiom of browsing to a central page for a site and then navigating outwards is acceptable when browsing is convenient, with large displays and useful input devices. This process becomes inconvenient, however, when the user is out and about in the world. We have built a system, Pivot, that uses physical objects as pivot points for the user. Specifically, Pivot uses the 1-D barcodes present on every product to deliver powerful services and options to a user on his or her cellphone. These services are chosen to be most useful to a user in the moment and trying to make a purchase decision. This paper describes the motivations for the system, the system itself, its current real-world deployment, and our intended future work.