ppxscal/embedding_network huggingface dataset:
Place cognition and active perception: a study with evolved robots
Authors: Orazio Miglino, Michela Ponticorvo, Paolo Bartolomeo
Venue: Connection Science (2009)

A study of place cognition and 'place units' in robots produced via artificial evolution is described. Previous studies have investigated the possible role of place cells as building blocks for 'cognitive maps' representing place, distance and direction. Studies also show, however, that when animals are restrained, the spatial selectivity of place cells is partially or completely lost. This suggests that the role of place cells in spatial cognition depends not only on the place cells themselves, but also on representations of the animal's physical interactions with its environment. This hypothesis is tested in a population of evolved robots. The results suggest that successful place cognition requires not only the ability to process spatial information, but also the ability to select the environmental stimuli to which the agent is exposed. If this is so, theories of active perception can make a useful contribution to explaining the role of place cells in spatial cognition.
Music search engines: Specifications and challenges
Authors: Alexandros Nanopoulos, Dimitrios Rafailidis, Maria M. Ruxanda, Yannis Manolopoulos
Venue: Information Processing and Management: an International Journal (2009)

Nowadays we have a proliferation of music data available over the Web. One of the imperative challenges is how to search these vast, global-scale musical resources to find preferred music. Recent research has envisaged the notion of music search engines (MSEs) that allow for searching preferred music over the Web. In this paper, we examine the growing research topic of MSEs, and provide potential specifications to follow and challenges to face.
Retrieving meaningful relaxed tightest fragments for XML keyword search
Authors: Lingbo Kong, Rémi Gilleron, Aurélien Lemay Mostrare
Venue: Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology (2009)

Adapting keyword search to XML data has been attractive recently, generalized as XML keyword search (XKS). One of its key tasks is to return the meaningful fragments as the result. [1] is the latest work following this trend, and it focuses on returning the fragments rooted at SLCA (Smallest LCA -- Lowest Common Ancestor) nodes. To guarantee that the fragments only contain interesting nodes, [1] proposes a contributor-based filtering mechanism in its MaxMatch algorithm. However, the filtering mechanism is not sufficient. It will commit the false positive problem (discarding interesting nodes) and the redundancy problem (keeping uninteresting nodes). In this paper, our interest is to propose a framework of retrieving meaningful fragments rooted at not only the SLCA nodes, but all LCA nodes. We begin by introducing the concept of Relaxed Tightest Fragment (RTF) as the basic result type. Then we propose a new filtering mechanism to overcome those two problems in Max-Match. Its kernel is the concept of valid contributor, which helps to distinguish the interesting children of a node. The new filtering mechanism is then to prune the nodes in a RTF which are not valid contributors to their parents. Based on the valid contributor concept, our ValidRTF algorithm not only overcomes those two problems in MaxMatch, but also satisfies the axiomatic properties deduced in [1] that an XKS technique should satisfy. We compare ValidRTF with MaxMatch on real and synthetic XML data. The result verifies our claims, and shows the effectiveness of our valid-contributor-based filtering mechanism.
Time series analysis of a Web search engine transaction log
Authors: Ying Zhang, Bernard J. Jansen, Amanda Spink
Venue: Information Processing and Management: an International Journal (2009)

In this paper, we use time series analysis to evaluate predictive scenarios using search engine transactional logs. Our goal is to develop models for the analysis of searchers' behaviors over time and investigate if time series analysis is a valid method for predicting relationships between searcher actions. Time series analysis is a method often used to understand the underlying characteristics of temporal data in order to make forecasts. In this study, we used a Web search engine transactional log and time series analysis to investigate users' actions. We conducted our analysis in two phases. In the initial phase, we employed a basic analysis and found that 10% of searchers clicked on sponsored links. However, from 22:00 to 24:00, searchers almost exclusively clicked on the organic links, with almost no clicks on sponsored links. In the second and more extensive phase, we used a one-step prediction time series analysis method along with a transfer function method. The period rarely affects navigational and transactional queries, while rates for transactional queries vary during different periods. Our results show that the average length of a searcher session is approximately 2.9 interactions and that this average is consistent across time periods. Most importantly, our findings shows that searchers who submit the shortest queries (i.e., in number of terms) click on highest ranked results. We discuss implications, including predictive value, and future research.
Pr&eacute;vention des risques en maintenance industrielle: apports et limites des techniques de r&eacute;alit&eacute; augment&eacute;e
Authors: Jacques Marsot, Virginie Govaere
Venue: Proceedings of the 20th International Conference of the Association Francophone d'Interaction Homme-Machine (2008)

After defining what Augmented Reality (AR) is, this article goes on to show the main interests and limits in relation to occupational risk prevention in industrial maintenance. From the assessment of the application of an AR prototype, we were able to verify the hypothesis put forward in the literature, namely that, compared to a paper document, the use of AR allows a reduction in execution errors in intervention procedures. However, despite the considerable technical progress made in recent years, AR techniques are not sufficiently mature to be used in real industrial conditions. The other results highlight questions regarding the impact of these new technologies on working conditions.
Empirical analysis for investigating the effect of object-oriented metrics on fault proneness: a replicated case study
Authors: K. K. Aggarwal, Yogesh Singh, Arvinder Kaur, Ruchika Malhotra
Venue: Software Process: Improvement and Practice (2009)

The importance of software measurement is increasing, leading to the development of new measurement techniques. Many metrics have been proposed related to the various object-oriented (OO) constructs like class, coupling, cohesion, inheritance, information hiding and polymorphism. The purpose of this article is to explore relationships between the existing design metrics and probability of fault detection in classes. The study described here is a replication of an analogous study conducted by Briand et al. The aim is to provide empirical evidence to draw the strong conclusions across studies. We used the data collected from Java applications for constructing a prediction model. Results of this study show that many metrics capture the same dimensions in the metric set, hence are based on comparable ideas and provides redundant information. It is shown that by using a subset of metrics prediction models can be built to identify faulty classes. The model predicts faulty classes with more than 90&percnt; accuracy. The predicted model shows that import coupling and size metrics are strongly related to fault proneness, confirming the results from previous studies. However, there are also differences reported in this study with respect to previous studies such as inheritance metric which counts methods inherited in a class is also included in the predicted model. Copyright &copy; 2008 John Wiley & Sons, Ltd.
A Permutation-Based Pyramid Broadcasting Scheme for Video-on-Demand Systems
Venue: Proceedings of the 1996 International Conference on Multimedia Computing and Systems (1996)

Periodic broadcasting can be used to support near video-on-demand for popular videos. For a given bandwidth allocation, pyramid broadcasting schemes substantially reduce the viewer latency (waiting) time as compared with conventional broadcasting schemes. Nevertheless, such pyramid schemes typically have substantial storage requirements at the client end, and this results in set-top boxes needing disks with high transfer rate capabilities. In this paper, we present a permutation-based pyramid scheme in which the storage requirements and disk transfer rates are greatly reduced, and yet the viewer latency is smaller as well. Under the proposed approach, each video is partitioned into contiguous segments of geometrically increasing sizes and each segment is further divided into blocks, where a block is the basic unit of transmission. As in the original pyramid scheme, frequencies of transmission for the different segments of a video vary in a manner inversely proportional to their size. Instead of transmitting the blocks in each segment in sequential order, the proposed scheme transmits these blocks in a prespecified cyclic permutation to save on storage requirements in the client end. Performance analyses are provided to quantify the benefits of the new scheme.
Trustable Remote Verification of Web Services
Authors: John Lyle
Venue: Proceedings of the 2nd International Conference on Trusted Computing (2009)

Service Oriented Architectures currently provide little or no evidence that each remote component has been implemented correctly. This is a problem for businesses hoping to exploit the potential benefits of SOA. We present a technique called Trustable Remote Verification, which lets providers create behavioural guarantees of their web services. Our approach is flexible, using Extended Static Checking for verification and has the significant advantage of requiring no additional trusted third party.
Fractal analysis of stealthy pathfinding aesthetics
Authors: Ron Coleman
Venue: International Journal of Computer Games Technology (2009)

This paper uses a fractal model to analyze aesthetic values of a new class of obstacle-prone or "stealthy" pathfinding which seeks to avoid detection, exposure, openness, and so forth in videogames. This study is important since in general the artificial intelligence literature has given relatively little attention to aesthetic outcomes in pathfinding. The data we report, according to the fractal model, suggests that stealthy paths are statistically significantly unique in relative aesthetic value when compared to control paths. We show furthermore that paths generated with different stealth regimes are also statistically significantly unique. These conclusions are supported by statistical analysis of model results on experimental trials involving pathfinding in randomly generated, multiroom virtual worlds.
Flexible authorisation in dynamic e-business environments using an organisation structure-based access control model
Authors: Tsung-Yi Chen, Yuh-Min Chen, Chin-Bin Wang, Hui-Chuan Chu
Venue: International Journal of Computer Integrated Manufacturing (2009)

In dynamic e-business and e-manufacturing environments, enterprises require a secure access control mechanism based on an access control model to manage employee authorisations flexibly. This study presents an organisation structure-based access control (OSAC) model based on a task-role-based access control (T-RBAC) model. The OSAC model emphasises that employee authorisations are generated directly based on their position in the enterprise organisational structure. The proposed model extends the concepts of static separation of duty (SSD), dynamic separation of duty (DSD), prerequisite, and cardinality constraints in the role-based access control (RBAC) model to present department and role relations that identify the cooperative interactive relations among roles across department boundaries to facilitate resource sharing among roles and simplify enterprise resource management. Various relations and applied examples are demonstrated using the class model in unified modelling language (UML). Examples of inappropriate use of relations that lead to violation of relation are also presented. To demonstrate the feasibility of the proposed model for most businesses, a case study involving an automobile component producer is presented and an OSAC model-based administrative management system is developed to ensure that appropriate resources can be legally used by the correct employees and at the right time. By applying the proposed model, administrators can easily manage resources based on an organisational structure perspective and the resource sharing capabilities of all departments can be improved.
Photoshop CS4 Essential Training
Authors: Jan Kabili
Venue:  (2008)

Photoshop has become an indispensible tool for photographers, designers, and all other creative professionals, as well as students. Photoshop CS4 Essential Training teaches a broad spectrum of core skills that are common to many creative fields: working with layers and selections; adjusting, manipulating, and retouching photos; painting; adding text; automating; preparing files for output; and more. Instructor Jan Kabili demonstrates established techniques as well as those made possible by some of the new features unique to Photoshop CS4. This course is indispensable to those who are new to the application, just learning this version, or expanding their skills. Example files accompany the course. Topics Include: Learning and customizing the interface and workspace Utilizing various manual and guided selection techniques Working with Adobe Camera Raw Adding special effects with layer styles and Smart Filters Creating Photomerge panoramas Optimizing photos for the web and creating web galleries Duration: 8.25 hoursOn 1 DVD-ROM System Requirements Macintosh Requirements OS 10.3.9 or higher DVD-ROM drive 1024x768 resolution 24-bit video support QuickTime 7 or higher Windows Requirements XP or Vista DVD-ROM Drive 1024x768 resolution 24-bit video support PC sound card/speakers QuickTime 7 or higher (included) .NET 2.0 or higher (included)
Design and implementation of low power network maintenance protocols in wireless health advanced mobile bio-diagnostic system for long-term periodical health telecare applications
Authors: Ming-Hui Jin, Ren-Guey Lee, Cheng-Yan Kao
Venue: Proceedings of the 6th conference on Applications of electrical engineering (2007)

Attempts to develop a Wireless Health Advanced Mobile Bio-diagnostic System (abbreviated as WHAM-BioS) have arisen from the need to monitor the health status of patients under long-term care programs. The proposed WHAM-BioS as presented here is developed by integrating various technologies: nano/MEMS technology, biotechnology, network/communication technology, and information technology. This study focuses on network/communication technology in the WHAM-BioS and proposes a novel clustered sensor network (CSN) architecture for long-term periodical telecare applications. In the proposed CSN architecture, most network functions are concentrated in a special purpose device called the human body gateway (HBG). The sensor nodes focus on detecting and reporting their detection results to their HBG. To reduce the design complexity and the implementation cost for the sensor nodes, the proposed architecture proposed several protocols to help each HBG to provide a contention free environment for their sensor nodes. The contention free environment avoids the power consumption in data retransmission. Besides, to further reduce the power consumption of the sensor nodes, this study also proposes a power saving mechanism which reduces the power consumption in idle listening. Based on the proposed network architecture and protocols, a prototype system is implemented.
E-exhibition towards international trade base on knowledge management
Authors: Zheng Lei-na, Pan Tie-Jun, Fang Lei-lei, Yu Yun, Hu Yue, Bao Hui-han
Venue: Proceedings of the 3rd WSEAS international conference on Computer engineering and applications (2009)

In recent years, the total number of traditional exhibition in developed countries show a decline, exhibitors are dropped because more of them use network technology to carry out on-line international trade, display products and the exchange of information. E-exhibition is to flourish which provide low cost and all-day exhibition to international trade of Medium-Sized Enterprise (SME), but the current only human-readable web content hindered E-exhibition development, we propose a kind of E-exhibition solution based on Semantic Web making web content machine-readable so that international trade can be more easily analyzed by software agents and shared among Web Services which can represent explicitly the core competitiveness of SME. Then, a new knowledge management methodology for E-exhibition of SME which including product, process, technology, services and application domain sub ontology based on semantics web is given. Furthermore, we propose E-exhibition logical view using Semantic Web, select the consumer goods as the application domain, and set up an E-exhibition platform of SME. In the end, consumer goods ontology architecture is give and a case study is shown, which proved that semantics web provide at least the infrastructure to build reusable structures among communities of E-exhibition for SME.
GCH: Hints for Triggering Garbage Collections
Authors: Dries Buytaert, Kris Venstermans, Lieven Eeckhout, Koen Bosschere
Venue: Transactions on High-Performance Embedded Architectures and Compilers I (2007)

This paper shows that Appel-style garbage collectors often make suboptimal decisions both in terms of when and how to collect. We argue that garbage collection should be done when the amount of live bytes is low (in order to minimize the collection cost) and when the amount of dead objects is high (in order to maximize the available heap size after collection). In addition, we observe that Appel-style collectors sometimes trigger a nursery collection in cases where a full-heap collection would have been better.Based on these observations, we propose garbage collection hints (GCH) which is a profile-directed method for guiding garbage collection. Off-line profiling is used to identify favorable collection points in the program code. In those favorable collection points, the garbage collector dynamically chooses between nursery and full-heap collections based on an analytical garbage collector cost-benefit model. By doing so, GCH guides the collector in terms of when and how to collect. Experimental results using the SPECjvm98 benchmarks and two generational garbage collectors show that substantial reductions can be obtained in garbage collection time (up to 29X) and that the overall execution time can be reduced by more than 10%. In addition, we also show that GCH reduces the maximum pause times and outperforms user-inserted forced garbage collections.
A case study on taxpayer segmentation
Authors: Olivier Glassey
Venue: Proceedings of the 2nd International Conference on Theory and Practice of Electronic Governance (2008)

In this paper, we describe a reorganization project that took place between 2004 and 2007 in a Swiss Cantonal tax administration. The information system was built from scratch by adding a new module each year and the organization was transformed accordingly. We will present the initial objectives of the project and discuss how these objectives evolved with time. We will also describe the lessons learned, particularly regarding the automation and semi-automation of tax declaration assessment and more generally in terms of governance.
Negotiation between Requester and Provider Based on Pragmatics Web Service
Authors: Zhai Sheping, Li Zengzhi, Wei Juanli
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 03 (2009)

Pragmatics Web Service is a novel pattern for designing and deploying Web Services with the concept of pragmatics as its knowledge foundation. It primarily concerns preference, context, communication and negotiation of service participants, so that the real meaning for conveyed message can be apprehend by the service requester or provider. In this paper, we propose an agent negotiation framework towards Pragmatics Web Service. First, we abstract the rule and policy for access control to private information about context, preference towards the Pragmatics Web Service. Second, we have formalized the access control rules, context information and preference policy, and stored them in the service ontology base possessed by service agent. Finally, we implement the ContractNet protocol negotiation by a house-leasing case under control of the rules, and compare experimentally the utility value of various negotiation strategy between service requester and service provider.
On the use of magnetic RAMs in field-programmable gate arrays
Authors: Y. Guillemenet, L. Torres, G. Sassatelli, N. Bruchon
Venue: International Journal of Reconfigurable Computing (2008)

This paper describes the integration of field-induced magnetic switching (FIMS) and thermally assisted switching (TAS) magnetic random access memories in FPGA design. The nonvolatility of the latter is achieved through the use of magnetic tunneling junctions (MTJs) in the MRAM cell. A thermally assisted switching scheme helps to reduce power consumption during write operation in comparison to the writing scheme in the FIMS-MTJ device. Moreover, the nonvolatility of such a design based on either an FIMS or a TAS writing scheme should reduce both power consumption and configuration time required at each power up of the circuit in comparison to classical SRAM-based FPGAs. A real-time reconfigurable (RTR) micro-FPGA using FIMS-MRAM or TAS-MRAM allows dynamic reconfiguration mechanisms, while featuring simple design architecture.
Neary: conversation field detection based on similarity of auditory situation
Authors: Toshiya Nakakura, Yasuyuki Sumi, Toyoaki Nishida
Venue: Proceedings of the 10th workshop on Mobile Computing Systems and Applications (2009)

This paper proposes a system called Neary that detects conversational fields and is designed to run on mobile machines with a network module and a microphone. Neary operates on a simple algorithm and a light-weight process, so other systems can incorporate it smoothly. In this paper, we show an implementation of our Neary system and its experimental evaluations. Neary can distinguish between two conversation groups one meter apart and dynamically detect the changes in the number and the physical size of conversation fields.
The constrained Fisher scoring method for maximum likelihood computation of a nonparametric mixing distribution
Authors: Yong Wang
Venue: Computational Statistics (2009)

This paper proposes a new method for computing the nonparametric maximum likelihood estimate of a mixing distribution. It uses the Fisher scoring quadratic approximation to the log-likelihood function of the mixing proportions. At each iteration, new candidate support points are found and included, as guided by the gradient function, and bad support points are discarded, after being found redundant by optimizing the quadratic approximation. Numerical studies show that the CFS method is generally competitive with the fast and stable constrained Newton method; it may even have an advantage over the latter when the initial estimate is badly chosen.