ppxscal/embedding_network huggingface dataset:
Overlapping on partitioned facial images
Authors: Önsen Toygar, Adnan Acan
Venue: Proceedings of the 6th WSEAS International Conference on Signal, Speech and Image Processing (2006)

The effect of overlapped classifiers on partitioning-based face recognition is presented. The features of facial images are extracted by appearance-based statistical dimensionality reduction algorithms for the recognition of horizontally and vertically partitioned facial images. The proposed approaches employ a divide-and-conquer strategy which aims to improve the recognition performance of holistic methods by emphasizing locally important features over horizontal or vertical segments. Additionally, computational complexity is also reduced significantly since feature extractions are performed over smaller facial regions. Analysis of the obtained results demonstrate that both vertical and horizontal partitioning achieve better recognition performance compared to the holistic counterparts. It is also observed that, for some of the statistical methods, overlapped feature extraction results in better recognition performance compared to disjoint partitioning approach. The proposed implementations achieved particularly superior performance for LDA- and ICA-based classifiers, for which the proposed approaches demonstrated the best so far published results.
Exact cell decomposition on base map features for optimal path finding
Authors: L. S. C. Pun-Cheng, M. Y. F. Tang, I. K. L. Cheung
Venue: International Journal of Geographical Information Science (2007)

Path-finding problems have attracted widespread research interest in GIS-T. Previous research has largely been conducted on developing shortest path algorithms in GIS. The conventional approach is to adopt the arc-node network model, which allows only users with expert knowledge to generate measurements such as optimal paths from a map. However, the generation and maintenance of a centreline network are difficult and tedious because these are not natural on-ground features but imaginary lines on a map. To remedy the situation, a revolutionary approach has been suggested that path-finding method is independent of extra arc-node data creations by end-users. By using the cell-decomposition method borrowed from motion planning of a robot, general map users may obtain an optimal path by just identifying familiarized symbols/outlines from a digital topographic map without resorting to generating an extra set of centrelines.
Squid: Enabling search in DHT-based systems
Authors: Cristina Schmidt, Manish Parashar
Venue: Journal of Parallel and Distributed Computing (2008)

A fundamental problem in large scale, decentralized distributed systems is the efficient discovery of information. This paper presents Squid, a peer-to-peer information discovery system that supports flexible searches and provides search guarantees. The fundamental concept underlying the approach is the definition of multi-dimensional information spaces and the maintenance of locality in these spaces. The key innovation is a dimensionality reducing indexing scheme that effectively maps the multi-dimensional information space to physical peers while preserving lexical locality. Squid supports complex queries containing partial keywords, wildcards and ranges. Analytical and simulation results show that Squid is scalable and efficient.
Conversion of matrix ODEs to certain universal and easily handlable forms via space extension
Authors: Sevda Üsküplü, Metin Demiralp
Venue: Proceedings of the 12th WSEAS International Conference on Applied Mathematics (2007)

This paper is focused on the conversion of matrix ordinary differential equations to certain universal forms which can be handled more easily than their original structures when the solutions to them is sought. This goal is realised by using the space extension concept. The concerned equations are chosen from certain specific ones although the generalization seems to be possible for all types of matrix ODEs. This paper concerns with the obtaining of new universal form not its solution. However certain clues about the solution technique construction are also presented.
Component Based Software Development - An Industrial Experience with a Labor Market Information System
Authors: Bhim Prasad Upadhyaya
Venue: Proceedings of the 19th Australian Conference on Software Engineering (2008)

This paper presents an experience gained in the developmentof a large component based application that handles massive federal and state government labor market information data. The process of transforming user requirements to deliverable software components are shown in various stages of development. Components developed are rated against existing specifications. Further, these components are classified based on their functionalities and location. Statistical information is presented for components, component types and re-use types. Our experience suggests two practical componentization methodologies and JavaBeansextensions. As per industry-taste, these extensions can become a part of future specifications in order to enable the development of fully component based applications. Wealso demonstrate uses of patterns to document our architecture.
eSeagull: Design of Mobile P2P File Sharing System at Sea
Authors: Huafeng Wu, Chaojian Shi, Xi Zhou, Haiguang Chen, Chuanshan Gao
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications - Workshops (2008)

With the outbreak of peer-to-peer applications and its great potential of file sharing, along with the rapid development of the marine telecommunication technologies, we feel the impulse to implement a mobile peer-to-peer file sharing system for the sea area, where the crew or passengers are far away from the land, expecting more for file and information sharing than people on shore. To achieve such a goal, we propose a mobile P2P architecture based on Next Generation Maritime Communication Network (NGMCN), which is kind of Heterogeneous Wireless Network (HWISE). In this paper, we design our mobile P2P overlay system, eSeagull, based on the proposed architecture. Through statistical analysis and simulation, it is demonstrated that this system is applicable and suitable for the marine domain.
An accessibility theorem for infinite graph minors
Authors: Reinhard Diestel
Venue: Journal of Graph Theory (2000)

We prove the following recent conjecture of Halin. Let &Gamma;0 be the class of all graphs, and for every ordinal &mu;&thinsp;>&thinsp;0 let &Gamma;&mu; be the class of all graphs containing infinitely many disjoint connected graphs from &Gamma;&lambda;, for every &lambda;&thinsp;<&thinsp;&mu;. Then a graph lies in all these classes &Gamma;&mu; if and only if it contains a subdivision of the infinite binary tree. Published by John Wiley & Sons, Inc., 2000 J Graph Theory 35: 273&ndash;277, 2000
pg4DB: A fuzzy object-relational system
Authors: L. Cuevas, N. Marín, O. Pons, M. A. Vila
Venue: Fuzzy Sets and Systems (2008)

Object-relational systems combine the robustness of the relational data model with the powerful modeling capabilities of the object-oriented paradigm. Object-relational database management systems (ORDBMS) allow us to implement a set of relations to store and retrieve objects coming from a hierarchy of classes. If we want to manipulate imprecise objects in this kind of systems, we have to properly extend them. In this paper we introduce pOSTgRESQL Fuzzy Object Relational DataBase (pg4DB), a framework that supports the management of fuzzy objects in ORDBMS such as PostgreSQL. As we will see pg4DB allows users to create imprecise objects and operate with them using object-relational SQL compliant sentences.
Control of the vorticity mode in the linearized Euler equations for hybrid aeroacoustic prediction
Authors: C. Prax, F. Golanski, L. Nadal
Venue: Journal of Computational Physics (2008)

The issue of vorticity mode perturbation in Linearized Euler Equations (LEE) is addressed in this paper. We chose to tackle this question by the point of view of source term formulation. It is numerically shown that the use of a rotational free acoustic source term significantly reduces the development of the hydrodynamic mode. In accordance with the theory, the proposed source term lead to a quasi total absence of vorticity mode in a spatially uniform mean flow, and a strong reduction in a sheared mean flow.
Empathetic living media
Authors: Adrian David Cheok, Roger Thomas Kok, Chuen Tan, Owen Noel Newton Fernando, Tim Merritt, Janyn Yen Ping Sen
Venue: Proceedings of the 7th ACM conference on Designing interactive systems (2008)

We describe a new form of interactive living media used to communicate social or ecological information in the form of an empathetic ambient media. In the fast paced modern world people are generally too busy to monitor various significant social or human aspects of their lives, such as time spent with their family, their overall health, state of the ecology, etc. By quantifying such information digitally, information is semantically coupled into living microorganisms, E. coli. Through the use of transformed DNA, the E. coli will then glow or dim according to the data. The core technical innovation of this system is the development of an information system based on a closed-loop control system through which digital input is able to control input fluids to the E. coli, and thereby control the output glow of the E. coli in real time. Thus, social or ecological based information is coupled into a living and organic media through this control system capsule and provides a living media which promotes empathy. We provide user design and feedback results to verify the validity of our hypothesis, and provide not only system results but generalized design frameworks for empathetic living media in general.
Starting and Resolving a Partitioned BRAIN
Authors: Michael Paulitsch, Brendan Hall
Venue: Proceedings of the 2008 11th IEEE Symposium on Object Oriented Real-Time Distributed Computing (2008)

Time-triggered communication is a favored design strategy for safety-critical systems. However, the startup of time-triggered systems is a significant concern, since the time-line from which fault-tolerance is supported must be established in segmented mediums, e.g. multi-hop networks. The startup problems are particularly challenging since clique formation, i.e. the establishment of disjoint time-triggered communication sets, may be systematically induced.This paper presents an alternative startup solution based upon a braided-ring architecture called BRAIN (Braided Ring Availa¬bi¬lity Integrity Network). Segmentation-in¬duced cliques are particularly prevalent in this architecture, since each node presents a potential medium break. The described strategy dramatically improves startup performance in relation to current approaches by leveraging the cooperative action of adjacent nodes during startup and high-integrity data propagation.
Structuring and modelling norms for the recyclability assessment of products during their design
Authors: R. Houe, B. Grabot
Venue: International Journal of Computer Integrated Manufacturing (2007)

Environmental issues, such as product recyclability, are becoming a crucial social concern for manufacturers. Often formulated in natural language, the norms and standards that govern these issues can be difficult to link to the product definition. It becomes necessary to provide the designer with appropriate support tools allowing, for instance, for the compliance of products with environmental criteria to be checked. In the current paper, we show how normative knowledge, coming from textual sources (eco-labels), can be expressed through constraints, allowing checking in a semi-automated process the recyclability of a product.
Using Unscented Kalman Filter for Road Tracing from Satellite Images
Authors: Sahar Movaghati, Alireza Moghaddamjoo, Ahad Tavakoli
Venue: Proceedings of the 2008 Second Asia International Conference on Modelling & Simulation (AMS) (2008)

The Extended Kalman Filter with profile matching has been employed to extract road maps in satellite images. This algorithm suffers from several drawbacks that result in its poor performance in difficult situations. To improve its performance in those situations, like junctions and varying road characteristics, we propose to use the Unscented Kalman Filter which can deal better with the nonlinearity of the road model. Additionally, we use anapproach to dissociate the system measurements from the current state prediction of the Kalman filter. This method removes the potential for the instability of the algorithm. Finally, we introduce a technique based on clustering of the road profiles to properly maintain a database on various road characteristics along the way. This way we provide a means to continue tracking even whenthe road profile undergoes significant variations.
Stochastic modeling of a thermally-managed multi-core system
Authors: Hwisung Jung, Peng Rong, Massoud Pedram
Venue: Proceedings of the 45th annual Design Automation Conference (2008)

Achieving high performance under a peak temperature limit is a first-order concern for VLSI designers. This paper presents a new abstract model of a thermally-managed system, where a stochastic process model is employed to capture the system performance and thermal behavior. We formulate the problem of dynamic thermal management (DTM) as the problem of minimizing the energy cost of the system for a given level of performance under a peak temperature constraint by using a controllable Markovian decision process (MDP) model. The key rationale for utilizing MDP for solving the DTM problem is to manage the stochastic behavior of the temperature states of the system under online re-configuration of its micro-architecture and/or dynamic voltage-frequency scaling. Experimental results demonstrate the effectiveness of the modeling framework and the proposed DTM technique.
Energy conservation by adaptive feature loading for mobile content-based image retrieval
Authors: Karthik Kumar, Yamini Nimmagadda, Yu-Ju Hong, Yung-Hsiang Lu
Venue: Proceeding of the 13th international symposium on Low power electronics and design (2008)

We present an adaptive loading scheme to save energy for content based image retrieval (CBIR) in a mobile system. In CBIR, images are represented and compared by high-dimensional vectors called features. Loading these features into memory and comparing them consumes a significant amount of energy. Our method adaptively reduces the features to be loaded into memory for each query image. The reduction is achieved by estimating the difficulty of the query and by reusing cached features in memory for subsequent queries. We implement our method on a PDA and obtain overall energy reduction of 61.3% compared with an existing CBIR implementation.
Dynamic testing of flow graph based parallel applications
Authors: Basile Schaeli, Roger D. Hersch
Venue: Proceedings of the 6th workshop on Parallel and distributed systems: testing, analysis, and debugging (2008)

In message-passing parallel applications, messages are not delivered in a strict order. The number of messages, their content and their destination may depend on the ordering of their delivery. Nevertheless, for most applications, the computation results should be the same for all possible orderings. Finding an ordering that produces a different outcome or that prevents the execution from terminating reveals a message race or a deadlock. Starting from the initial application state, we dynamically build an acyclic message-passing state graph such that each path within the graph represents one possible message ordering. All paths lead to the same final state if no deadlock or message race exists. If multiple final states are reached, we reveal message orderings that produce the different outcomes. The corresponding executions may then be replayed for debugging purposes. We reduce the number of states to be explored by using previously acquired knowledge about communication patterns and about how operations read and modify local process variables. We also describe a heuristic that tests a subset of orderings that are likely to reveal existing message races or deadlocks. We applied our approach on several applications developed using the Dynamic Parallel Schedules (DPS) parallelization framework. Compared to the naive execution of all message orderings, the use of a message-passing state graph reduces the cost of testing all orderings by several orders of magnitude. The use of prior information further reduces the number of visited states by a factor of up to fifty in our tests. The heuristic relying on a subset of orderings was able to reveal race conditions in all tested cases. We finally present a first step in generalizing the approach to MPI applications.
Computation of medial axis and offset curves of curved boundaries in planar domain
Authors: Lixin Cao, Jian Liu
Venue: Computer-Aided Design (2008)

In this paper, we begin our research from the generating theory of the medial axis. The normal equidistant mapping relationships between two boundaries and its medial axis have been proposed based on the moving Frenet frames and Cesaro's approach of the differential geometry. Two pairs of adjoint curves have been formed and the geometrical model of the medial axis transform of the planar domains with curved boundaries has been established. The relations of position mapping, scale transform and differential invariants between the curved boundaries and the medial axis have been investigated. Based on this model, a tracing algorithm for the computation of the medial axis has been generated. In order to get the accurate medial axis and branch points, a Two_Tangent_Points_Circle algorithm and a Three_Tangent_Points_Circle algorithm have been generated, which use the results of the tracing algorithm as the initial values to make the iterative process effective. These algorithms can be used for the computation of the medial axis effectively and accurately. Based on the medial axis transform and the envelope theory, the trimmed offset curves of curved boundaries have been investigated. Several numerical examples are given at the end of the paper.
Regret minimization and the price of total anarchy
Authors: Avrim Blum, MohammadTaghi Hajiaghayi, Katrina Ligett, Aaron Roth
Venue: Proceedings of the 40th annual ACM symposium on Theory of computing (2008)

We propose weakening the assumption made when studying the price of anarchy: Rather than assume that self-interested players will play according to a Nash equilibrium (which may even be computationally hard to find), we assume only that selfish players play so as to minimize their own regret. Regret minimization can be done via simple, efficient algorithms even in many settings where the number of action choices for each player is exponential in the natural parameters of the problem. We prove that despite our weakened assumptions, in several broad classes of games, this "price of total anarchy" matches the Nash price of anarchy, even though play may never converge to Nash equilibrium. In contrast to the price of anarchy and the recently introduced price of sinking, which require all players to behave in a prescribed manner, we show that the price of total anarchy is in many cases resilient to the presence of Byzantine players, about whom we make no assumptions. Finally, because the price of total anarchy is an upper bound on the price of anarchy even in mixed strategies, for some games our results yield as corollaries previously unknown bounds on the price of anarchy in mixed strategies.
Reliable Evidence of Data Integrity from an Untrusted Storage Service
Authors: Claudius Stern, Philipp Adelt, Volker Krummel, Marcel R. Ackermann
Venue: Proceedings of the Fourth International Conference on Networking and Services (2008)

Digital storage demand is growing with the increasing use of digital artifacts from media files to business documents. Regulatory frameworks ask for unaltered, durable storage of business communications. In this paper we consider the problem of getting reliable evidence of the integrity and existence of some data from a storage service even if the data is not available for reference anymore and even if the partner may be untrustworthy or malicious. Several solutions are presented, among them the first cryptographically secure approach providing evidence of the integrity of remotely stored data, without owning or transferring the complete original data.
The Primary Mechanism of Photoexcited TiO2 Nanoparticles-induced Apoptosis in Human Hepatoma Bel-7402 Cells
Authors: Chun-Hui Xia, Wen-Xue Yu, Bai-Qi Wang, Yu Wang, Lu Wang
Venue: Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics - Volume 02 (2008)

Aim: To investigate the primary mechanism of photoexcited TiO2 nanoparticles -induced apoptosis in Bel-7402 cell. Methods: Bel-7402 cells were treated with photoexcited TiO2 nanoparticles. Cells inhibitory rate was assayed by the 3-(4, 5-dimethylthiazol-2-yl)-2, 5-diphenyl-tetrazolium bromide (MTT) method. Cell apoptosis was evaluated by both flow cytometry (FCM) and Haematoxylin and Eosin (HE) Staining method. Expression of caspase 3 and bcl-2 were determined by Western blot, respectively. Results: Photoexcited TiO2 nanoparticles exhibited good inhibition effects on Bel-7402 cells under appropriate TiO2 concentration; Both morphological observations and FCM results showed that photoexcited TiO2 nanoparticles induced apoptosis in Bel-7402 cells with concomitant increase of activated caspase-3 expression and decrease of bcl-2 expression. Conclusion: Photoexcited TiO2 nanoparticles can apparently inhibit Bel-7402 cells under appropriate concentration, and the inhibition process follows first order reaction rule approximately. In addition, photoexcited TiO2 nanoparticles can remarkably induce apoptosis in Bel-7402 cells, and the molecular mechanism of apoptosis is closely associated with increase of activated caspase-3 and down-regulation of the bcl-2 expression. The present work provides strong experimental foundation of Photoexcited TiO2 nanoparticles in the clinical treatment of tumor.
How Do Nerve Cells Compute?
Authors: Javier E. Hasbun
Venue: Computing in Science and Engineering (2008)

Javier E. Hasbun reviews Christof Koch's Biophysics of Computation: Information Processing in Single Neurons.
AMP: An Affinity-Based Metadata Prefetching Scheme in Large-Scale Distributed Storage Systems
Authors: Lin Lin, Xuemin Li, Hong Jiang, Yifeng Zhu, Lei Tian
Venue: Proceedings of the 2008 Eighth IEEE International Symposium on Cluster Computing and the Grid (2008)

Prefetching is an effective technique for improving file access performance, which can significantly reduce access latency for I/O systems. In distributed storage systems, prefetching for metadata files is critical for the overall system performance. In this paper, an Affinity-based Metadata Prefetching (AMP) scheme is proposed for metadata servers in large-scale distributed storage systems to provide aggressive metadata prefetching. Through mining useful information about metadata accesses from past history, AMP can discover metadata file affinities accurately and intelligently for prefetching. Compared with LRU and some of the latest file prefetching algorithms such as Nexus and C-Miner, our trace-driven simulations show that AMP can improve buffer cache hit rates by up to 12%, 4.5% and 4% respectively, while reduce the average response time by up to 60%, 12% and 8%, respectively.