ppxscal/embedding_network huggingface dataset:
Making history: intentional capture of future memories
Authors: Daniela Petrelli, Elise van den Hoven, Steve Whittaker
Venue: Proceedings of the 27th international conference on Human factors in computing systems (2009)

Lifelogging' technology makes it possible to amass digital data about every aspect of our everyday lives. Instead of focusing on such technical possibilities, here we investigate the way people compose long-term mnemonic representations of their lives. We asked 10 families to create a time capsule, a collection of objects used to trigger remembering in the distant future. Our results show that contrary to the lifelogging view, people are less interested in exhaustively digitally recording their past than in reconstructing it from carefully selected cues that are often physical objects. Time capsules were highly expressive and personal, many objects were made explicitly for inclusion, however with little object annotation. We use these findings to propose principles for designing technology that supports the active reconstruction of our future past.
Decisions, Actions, and Games: A Logical Perspective
Authors: Johan Benthem
Venue: Proceedings of the 3rd Indian Conference on Logic and Its Applications (2009)

Over the past decades, logicians interested in rational agency and intelligent interaction studied major components of these phenomena, such as knowledge, belief, and preference. In recent years, standard `static' logics describing information states of agents have been generalized to dynamic logics describing actions and events that produce information, revise beliefs, or change preferences, as explicit parts of the logical system. [22], [1], [12] are up-to-date accounts of this dynamic trend (the present paper follows Chapter 9 of the latter book). But in reality, concrete rational agency contains all these dynamic processes entangled. A concrete setting for this entanglement are games --- and this paper is a survey of their interfaces with logic, both static and dynamic. Games are intriguing also since their analysis brings together two major streams, or tribal communities: `hard' mathematical logics of computation, and `soft' philosophical logics of propositional attitudes. Of course, this hard/soft distinction is spurious, and there is no natural border line between the two sources: it is their congenial mixture that makes current theories of agency so lively. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
PicAChoo: a tool for customizable feature extraction utilizing characteristics of textual data
Authors: Jaeseok Myung, Jung-Yeon Yang, Sang-goo Lee
Venue: Proceedings of the 3rd International Conference on Ubiquitous Information Management and Communication (2009)

Although documents have hundreds of thousands of unique words, only a small number of words are significantly useful for intelligent services. For this reason, feature extraction has become an important issue to be addressed in various fields, such as information retrieval, text mining, pattern recognition, etc. Numerous supporting tools for feature extraction are available, but most of them deal with text as a simple literal. Unfortunately, text is not just a literal, but a semantically significant unit including linguistic characteristics. So, we need customized extraction methods that consider the characteristics of source documents. PicAChoo stands for 'Pick And Choose', and it provides an environment which enables feature extraction methods using the structure of sentences and the part-of-speech information of words. Moreover, we suggest dynamic composition of different extraction methods without hard-coding.
Sparse Multiscale Patches (SMP) for Image Categorization
Authors: Paolo Piro, Sandrine Anthoine, Eric Debreuve, Michel Barlaud
Venue: Proceedings of the 15th International Multimedia Modeling Conference on Advances in Multimedia Modeling (2009)

In this paper we address the task of image categorization using a new similarity measure on the space of Sparse Multiscale Patches (SMP). SMP s are based on a multiscale transform of the image and provide a global representation of its content. At each scale, the probability density function (pdf) of the SMP s is used as a description of the relevant information. The closeness between two images is defined as a combination of Kullback-Leibler divergences between the pdfs of their SMP s.In the context of image categorization, we represent semantic categories by prototype images, which are defined as the centroids of the training clusters. Therefore any unlabeled image is classified by giving it the same label as the nearest prototype. Results obtained on ten categories from the Corel collection show the categorization accuracy of the SMP method.
A real-time identification method of a slow process parameters using an adaptive algorithm
Authors: Caius Panoiu, Manuela Panoiu, Liviu Toma, Raluca Rob
Venue: Proceedings of the 8th conference on Systems theory and scientific computation (2008)

In this paper, the authors present a real time identification of the parameters value of a slow process. This kind of process can be assimilating to a time constant and a delayed time. The parameters are identification by using an adaptive algorithm. The initial values of the parameters can be compute using an on-line identification method and they are necessary to ensure the convergence of the adaptive algorithm.
Temporal-Relational Classifiers for Prediction in Evolving Domains
Authors: Umang Sharan, Jennifer Neville
Venue: Proceedings of the 2008 Eighth IEEE International Conference on Data Mining (2008)

Many relational domains contain temporal information and dynamics that are important to model (e.g., social networks, protein networks). However, past work in relational learning has focused primarily on modeling static "snapshots" of the data and has largely ignored the temporal dimension of these data. In this work, we extend relational techniques to temporally-evolving domains and outline a representational framework that is capable of modeling both temporal and relational dependencies in the data. We develop efficient learning and inference techniques within the framework by considering a restricted set of temporal-relational dependencies and using parameter-tying methods to generalize across relationships and entities. More specifically, we model dynamic relational data with a two-phase process, first summarizing the temporal-relational information with kernel smoothing, and then moderating attribute dependencies with the summarized relational information. We develop a number of novel temporal-relational models using the framework and then show that the current approaches to modeling static relational data are special cases within the framework. We compare the new models to the competing static relational methods on three real-world datasets and show that the temporal-relational models consistently outperform the relational models that ignore temporal information - achieving significant reductions in error ranging from 15% to 70%.
Nonconcave penalized inverse regression in single-index models with high dimensional predictors
Authors: Li-Ping Zhu, Li-Xing Zhu
Venue: Journal of Multivariate Analysis (2009)

In this paper we aim to estimate the direction in general single-index models and to select important variables simultaneously when a diverging number of predictors are involved in regressions. Towards this end, we propose the nonconcave penalized inverse regression method. Specifically, the resulting estimation with the SCAD penalty enjoys an oracle property in semi-parametric models even when the dimension, p"n, of predictors goes to infinity. Under regularity conditions we also achieve the asymptotic normality when the dimension of predictor vector goes to infinity at the rate of p"n=o(n^1^/^3) where n is sample size, which enables us to construct confidence interval/region for the estimated index. The asymptotic results are augmented by simulations, and illustrated by analysis of an air pollution dataset.
The factored policy-gradient planner
Authors: Olivier Buffet, Douglas Aberdeen
Venue: Artificial Intelligence (2009)

We present an any-time concurrent probabilistic temporal planner (CPTP) that includes continuous and discrete uncertainties and metric functions. Rather than relying on dynamic programming our approach builds on methods from stochastic local policy search. That is, we optimise a parameterised policy using gradient ascent. The flexibility of this policy-gradient approach, combined with its low memory use, the use of function approximation methods and factorisation of the policy, allow us to tackle complex domains. This factored policy gradient (FPG) planner can optimise steps to goal, the probability of success, or attempt a combination of both. We compare the FPG planner to other planners on CPTP domains, and on simpler but better studied non-concurrent non-temporal probabilistic planning (PP) domains. We present FPG-ipc, the PP version of the planner which has been successful in the probabilistic track of the fifth international planning competition.
Computer Algebra With Symbolic C++
Authors: Yorick Hardy, Kiat Shi Tan, Willi-Hans Steeb
Venue:  (2008)

This book gives a comprehensive introduction to computer algebra together with advanced topics in this field. It provides a detailed coverage of the mathematics of computer algebra as well as a step-by-step guide to implement a computer algebra system in the object-oriented language C++. The used tools from C++ are introduced in detail. Numerous examples from mathematics, physics and engineering are presented to illustrate the system's capabilities. Computer algebra implementations in LISP and Haskell are also included. In addition, gene expression programming and multiexpression programming with applications to computer algebra are introduced.
Finite Difference Method for Two-Dimensional Equations of Gas Dynamics Using Artificial Viscosity
Authors: Igor V. Popov, Igor V. Fryazinov
Venue: Numerical Analysis and Its Applications: 4th International Conference, NAA 2008, Lozenetz, Bulgaria, June 16-20, 2008. Revised Selected Papers (2009)

A new finite difference method is proposed for gas dynamics equations. It is a homogeneous, monotonic scheme of second order of accuracy on time and space outside domains of discontinuity and shock waves. A new way to introduce artificial viscosity is proposed for two-dimensional schemes. Test simulations of discontinues and shock waves are presented.
Counteract SYN flooding using second chance packet filtering
Authors: Chu-Hsing Lin, Fuu-Cheng Jiang, Wei-Shen Lai, Wei-Yuah Lee, Wei-Cheng Hsu
Venue: Proceedings of the 3rd International Conference on Ubiquitous Information Management and Communication (2009)

One barrier that hinders wired and wireless LAN, is the security problems caused by ubiquitous attackers. From the 4-layer protocol stack architecture in the Internet, the TCP layer seems to be vulnerable to flooding attacks, like the notorious Distributed Denial of Service (DDoS), due to 3-way handshaking mechanism defined in the connection-oriented TCP layer. In wireless LAN, the assaulting patterns from TCP-based DDoS have the similar destructive patterns as that in the wired Internet. In this article, we propose a feasible approach to alleviate the impact caused by TCP SYN Flooding. With the effective dual-queue application, the proposed Second Chance Packet Filtering (SCPF) scheme can efficiently decrease the probability of accepting bad frames, under the condition of not bothering the legal frames as possible, and therefore counteract the TCP SYN Flooding to an acceptable level. Although the proposed method cannot solve the TCP SYN Flooding problem completely, it still provides an efficient, cost-effective approach to mitigate the DDoS attacks for the legitimate users.
An innovative analyser for multi-classifier e-mail classification based on grey list analysis
Authors: Md Rafiqul Islam, Wanlei Zhou, Minyi Guo, Yang Xiang
Venue: Journal of Network and Computer Applications (2009)

In this paper, we propose a new technique of e-mail classification based on the analysis of grey list (GL) from the output of an integrated model, which uses multi-classifier classification ensembles of statistical learning algorithms. The GL is the output of a list of classifiers which are not categorized as true positive (TP) nor true negative (TN) but in an unclear status. Many works have been done to filter spam from legitimate e-mails using classification algorithms and substantial performance has been achieved with some amount of false-positive (FP) tradeoffs. However, in spam filtering applications the FP problem is unacceptable in many situations, therefore it is critical to properly classify e-mails in the GL. Our proposed technique uses an innovative analyser for making decisions about the status of these e-mails. It has been shown that the performance of our proposed technique for e-mail classification is much better than the existing systems, in terms of reducing FP problems and improving accuracy.
A splitting method for incompressible flows with variable density based on a pressure Poisson equation
Authors: J. -L. Guermond, Abner Salgado
Venue: Journal of Computational Physics (2009)

A new fractional time-stepping technique for solving incompressible flows with variable density is proposed. The main feature of this method is that, as opposed to other known algorithms, the pressure is determined by just solving one Poisson equation per time step, which greatly reduces the computational cost. The stability of the method is proved and the performance of the method is numerically illustrated.
Plenary lecture V: modeling pedestrian dynamics in evacuation processes
Authors: Robert A. Kosinski
Venue: Proceedings of the 8th conference on Simulation, modelling and optimization (2008)

In the paper the mathematical model of the evacuation processes from a chosen types of rooms in buildings, based on the Langevin equations, is presented. This process is an example of a collective dynamics of a set of self driven particles. In the equations additional term - social force - describing the interactions of the pedestrian with obstacles and other pedestrians, is included. As a result of numerical simulations the trajectories of each pedestrian in the room are found and the time of evacuation is calculated as a function of the desired velocity of pedestrians, which can be treated as the measure of the level of panic. Evacuation process can have laminar or turbulent character, depending on the geometry of the room and the number of persons present in it.
We the people and the right to broadband
Authors: Laurie Rowell
Venue: netWorker (2009)

The push for universal broadband to rural America could be this century's stab at rural electrification and phone service.
The research of interactive new media on the application of product customization web interface design strategy: take Der-Horng Art Frame interactive online system for example
Authors: Tsen Wang
Venue: Proceedings of the 2008 International Conference on Advances in Computer Entertainment Technology (2008)

'New Media' generally refers to the innovation of information technology and user interface. On the other hand, new media also means the qualitative change of the traditional media on form, content and variety. New media combines the digital information of text, images, animation and videos in digital format. In addition, the 'Interactive New Media' make the user has the ability to access and control the content actively or passively. Following the coming of digital area, the consumers are not only passively aware the advertising and buy the general design products; the modern consumers wish actively involves the process of design and make the product which can satisfied his/her personal wish. However, what strategies that designer can choose to help them to confront with such complex and interactive needing on the new media design? This research cooperates with a traditional frame factory at Tainan, Der-Horng Art Frame. Because of Der-Horng Art Frame proposed the needing of branding and marking design change, the research group takes the case as an example to practice an interactive online customized frame ordering system (see figure1). The case plan and design by following the creative process of Scient studio, an well known global e business consultant company. In addition, the research also uses the methodology of interview, content analysis and case studies compare and revise the design. The results could be the possible reference of the creative model for future new media design, visual communication and consumers' activities research in the future.
Driver Hypo-vigilance Detection Based on Eyelid Behavior
Authors: Mohamad Hoseyn Sigari
Venue: Proceedings of the 2009 Seventh International Conference on Advances in Pattern Recognition (2009)

Driver face monitoring system is a real-time system that can detect driver fatigue and driver distraction using machine vision approaches. In this paper, a new algorithm is proposed for driver hypo-vigilance detection based on eye-region processing and without explicit eye detection stage. In this method, horizontal projection of top half-segment of facial image is used to extract symptoms of fatigue and distraction. Percentage of eye closure (PERCLOS) and eyelid distance changes during time are used for fatigue detection; and eye closure rate is used for distraction detection. The novelty of our method is in adaptive feature extraction using spatio-temporal processing without explicit eye detection. Processing rate of proposed method is more than 5 frames per second.
Games with coupled propagated constraints in optical networks with multi-link topologies
Authors: Yan Pan, Lacra Pavel
Venue: Automatica (Journal of IFAC) (2009)

We consider games in optical networks in the class of m-player games with coupled utilities and constraints. Nash equilibria of such games can be computed based on recent extension of duality to a game theoretical framework. This work extends previous results on games with coupled constraints in optical links to multi-link topologies. Coupled constraints in optical networks are propagated along links, which introduces additional complexities for analysis. Specifically, convexity of the propagated constraints is no longer automatically ensured. We show that convexity is satisfied for single-sink multi-link topologies. The general case of multi-links with arbitrary sources and sinks is dealt with by a partitioned game with stages. We exploit the single-sink structure of each stage and the ladder-nested form of the game and we discuss iterative computation of equilibria based on a three-level hierarchical algorithm and prove its convergence under certain conditions.
Object Extraction Using a Stochastic Birth-and-Death Dynamics in Continuum
Authors: Xavier Descombes, Robert Minlos, Elena Zhizhina
Venue: Journal of Mathematical Imaging and Vision (2009)

We define a new birth and death dynamics dealing with configurations of disks in the plane. We prove the convergence of the continuous process and propose a discrete scheme converging to the continuous case. This framework is developed to address image processing problems consisting in detecting a configuration of objects from a digital image. The derived algorithm is applied for tree crown extraction and bird detection from aerial images. The performance of this approach is shown on real data.
An upper bound on multi-hop multi-channel wireless network performance
Authors: T. J. M. Coenen, M. de Graaf, Richard J. Boucherie
Venue: Proceedings of the International Conference on Mobile Technology, Applications, and Systems (2008)

Given a placement of wireless multi-radio nodes in space and a traffic demand between pairs of nodes, can these traffic demands be supported by the resulting network? The key issue in this setting is the wireless interference between neighbouring nodes using the same channel, including self-interference along multi-hop paths. We extend previous work addressing this problem taking into consideration the availability of multiple channels. As such, this paper presents a generic model for sustainable network load in a multi-hop multichannel setting and recasts this model in a multicommodity flow problem with interference constraints. A theorem is stated which gives a necessary and sufficient condition for the feasibility of this multicommodity flow problem. From this theorem an upper bound is derived for the throughput that can be achieved by the network, which is illustrated by examples. We indicate how the results can be used as a basis for a channel allocating algorithm.
Enhancing Visualizations of Business Processes
Authors: Philip Effinger, Michael Kaufmann, Martin Siebenhaller
Venue: Graph Drawing: 16th International Symposium, GD 2008, Heraklion, Crete, Greece, September 21-24, 2008. Revised Papers (2009)

In today's business world, there exist multitudinous tools to model processes. For an automatic layout algorithm for those processes, it is important to take into account criteria like process flow and the semantic of the modeling notation. Most of the existing tools use standard layout approaches that often produce unsatisfying results since the calculated drawings are too dense and/or too large. This makes it difficult for users to understand the underlying process model.
Weighted Threshold Secret Image Sharing
Authors: Shyong Jian Shyu, Chun-Chieh Chuang, Ying-Ru Chen, Ah-Fur Lai
Venue: Proceedings of the 3rd Pacific Rim Symposium on Advances in Image and Video Technology (2009)

Given a secret image I, a threshold r, and a set of n (&thinsp;&ge;&thinsp;r) participants P&thinsp;=&thinsp;{1, 2, ... , n} with a set of weights W&thinsp;=&thinsp;{w 1, w 2, ... , w n } where w i is the weight (which indicates the degree/rank of importance) of participant i and we assume that w 1&thinsp;&le;&thinsp;w 2&thinsp;&le;&thinsp;... w n . The idea of weighted threshold secret image sharing encodes I into n shadows S 1, S 2, ..., S n with sizes |S 1|&thinsp;&le;&thinsp;|S 2|&thinsp;&le;&thinsp;... |S n | in which S i is distributed to participant i such that only when a group of r participants can reconstruct I by using their shadows, while any group of less than r participants cannot. We propose a novel weighted threshold secret image sharing scheme based upon Chinese remainder theorem in this paper. As compared to the conventional Shamir&rsquo;s and recent Thien-Lin&rsquo;s schemes, which produce shadows with the same size, our scheme is more flexible due to the reason that the dealer is able to distribute various-sized shadows to participants with different degrees/ranks of importance in terms of practical concerns.
Path coverage properties of randomly deployed sensors with finite data-transmission ranges
Authors: Junko Harada, Shigeo Shioda, Hiroshi Saito
Venue: Computer Networks: The International Journal of Computer and Telecommunications Networking (2009)

We analyze the path coverage properties of a sensor network, where numerous sensors are randomly deployed. We characterize the path coverage in terms of three metrics: fraction of coverage, probability of complete coverage, and probability of partial coverage. We derive the expressions for the three coverage metrics as functions of the sensor density, the sensing range of a sensor, and the data-transmission range of a sensor. Based on the derived expressions, we study the impact of the data-transmission range on the path coverage and show, for example, that a sensor should have a long data-transmission range in order to achieve high detectability of intruding objects (partial coverage probability of the trajectories of objects) with a modest sensor density.