ppxscal/embedding_network huggingface dataset:
A classification method to distinguish cell-specific responses elicited by current pulses in hippocampal ca1 pyramidal cells
Authors: José Ambros-Ingerson, Lawrence M. Grover, William R. Holmes
Venue: Neural Computation (2008)

The suprathreshold electrophysiological responses of pyramidal cells have been grouped into large classes such as bursting and spiking. However, it is not known whether, within a class, response variability ranges uniformly across all cells or whether each cell has a unique and consistent profile that can be differentiated. A major difficulty when comparing suprathreshold responses is that slight variations in spike timing in otherwise very similar traces render traditional metrics ineffective. To address these issues, we developed a novel distance measure based on fiducial points to quantify the similarity among traces with trains of action potentials and applied it together with classification techniques to a set of in vitro patch clamp recordings from CA1 pyramidal cells. We tested if responses to repeated current stimulation of a given cell would cluster together yet remain distinct from those of other cells. We found that depolarizing and hyperpolarizing current pulses elicited responses in each cell that clustered and were systematically distinguishable from responses in other cells. The fiducial-point distance measure was more effective than other methods based on spike times and voltage-gradient phase planes. Depolarizing traces were more reliably differentiated than hyperpolarizing traces, and combining both scores was even more effective. These results suggest that each CA1 pyramidal cell has unique properties that can be detected and quantified with methods discussed here. This uniqueness may be due to slight variations in morphology or membrane channel densities and kinetics, or to large, coordinated variations in these elements. Ascertaining the actual sources and their degree of variability is important when constructing network models of neural function to ensure that key mechanisms are robust in the face of variations within these ranges. The analytical tools presented here can assist in constructing detailed cell models to match experimental records to elucidate the sources of electrophysiological variability in neurons.
Morphological mesh filtering and α-objects
Authors: Nicolas Loménie, Georges Stamon
Venue: Pattern Recognition Letters (2008)

Since image analysis techniques have come to maturity, mesh analysis has remained challenging requiring more and more efforts for elaborating an effective theoretical model. In this article, following algebraic mesh operators, we introduce algorithms that perform morphological transformations on unorganized point sets connected by their Delaunay triangulations. We show that these algorithms correspond to morphological operators like erosion, dilation or opening, acting as ''shape filters'' on meshes. More theoretically, a link is established between these algorithms and the formalisms of edge algebra and @a-objects. Then, the mesh operators are defined in terms of complete lattices. These algorithms are applied to the problem - among others - of scene reconstruction by stereoscopy in which objects are represented by unstructured and noisy clouds of 3D points. Rapid prototyping should also benefit from these algorithms.
Practical Design of Intelligent Living-Space Based on Blue-Tooth System
Authors: Chun-Liang Hsu, Teng-Yaw Hsu, Kuan-Yen Ho, Wei-Bin Wu
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications - Workshops (2008)

This paper mainly focused on exploring the intelligent living-space issues of daily life, especially when mankind steps into 21st century leading by concept of 3C. Since Japan and Korea have invested a lot of resource in researching and developing digitalizing living-space many years, those strategies really upgraded the competition potential of country’s economy and created many related brand-new industries for 3C. Taiwan now positively touches into this category of manufacturing industry by initiating from Far-eastern Constructing Co.Ltd., which proposed “Digitalized Community” and began the research category of the intelligent living-space. In this paper, an intelligent living-space based on blue-tooth system was practically designed and implemented in a living room, which was supported by the Taiwan Education Ministry under “Projects of Improving Teaching Superiority Taiwan colleges”, and the whole system was finally proved to be successful with its steady functions. The related techniques developed included software developing of blue-tooth modules, hardware design of interface transition between blue-tooth and RS-232, decoding of message package, pairs matching, and communication mode switching in multi-modules. The study purposes of the system are : 1. To study the related techniques of blue-tooth modules and its communication mechanism implemented in an intelligent living-space. 2. To research and develop a remote control system or monitoring system with the blue-tooth communication system. 3. To develop the interface between blue-tooth module and RS232 mounted on any microprocessor or PC.
Simultaneous matchings: Hardness and approximation
Authors: Martin Kutz, Khaled Elbassioni, Irit Katriel, Meena Mahajan
Venue: Journal of Computer and System Sciences (2008)

Given a bipartite graph G=(X@?@?D,E@?XxD), an X-perfect matching is a matching in G that covers every node in X. In this paper we study the following generalisation of the X-perfect matching problem, which has applications in constraint programming: Given a bipartite graph as above and a collection F@?2^X of k subsets of X, find a subset M@?E of the edges such that for each C@?F, the edge set M@?(CxD) is a C-perfect matching in G (or report that no such set exists). We show that the decision problem is NP-complete and that the corresponding optimisation problem is in APX when k=O(1) and even APX-complete already for k=2. On the positive side, we show that a 2/(k+1)-approximation can be found in poly(k,|X@?D|) time. We show also that such an approximation M can be found in time (k+(k2)2^k^-^2)poly(|X@?D|), with the further restriction that each vertex in D has degree at most 2 in M.
DPM at OS level: low-power scheduling policies
Authors: C. Brandolese, W. Fornaciari, F. Salice, L. Pomante, R. Zafalon
Venue: Proceedings of the 5th WSEAS International Conference on Circuits, Systems, Electronics, Control & Signal Processing (2006)

Reducing power consumption has become one of the major goals in designing electronic systems for mobile devices and embedded applications. One of the most promising approaches, called Dynamic Power Management (DPM), is to adapt at run-time power states of system components by means of changing the operating voltage of a processor as well as switching I/O devices to low-power sleeping states during periods of inactivity. This work is aimed to provide innovative strategies to enhance the capabilities of a potential Power Manager that acts at the operating system level. In particular, several low-power process scheduling policies, increasing the possibility to conveniently force devices into low power states, have been implemented in the Linux operating system to verify their feasibility and to analyze their benefits and drawbacks.
Implementation of OpenVG 1.0 using OpenGL ES
Authors: Aekyung Oh, Hyunchan Sung, Hwanyong Lee, Kujin Kim, Nakhoon Baek
Venue: Proceedings of the 9th international conference on Human computer interaction with mobile devices and services (2007)

OpenVG 1.0 is a 2D vector graphics standard and its API (Application Programming Interface) was released by the Khronos Group. In this paper, we introduce our OpenVG 1.0 implementation, accelerated by OpenGL ES 1.x hardware. Our implementation is an efficient and cost-effective way of accelerating OpenVG, fully utilizing the existing hardware in current embedded systems. Conclusively, our OpenVG implementation shows dramatically outstanding performance with low power consumption.
The importance of cognitive architectures: an analysis based on CLARION
Authors: Ron Sun
Venue: Journal of Experimental Theoretical Artificial Intelligence (2007)

Research in computational cognitive modelling investigates the nature of cognition through developing process-based understanding by specifying computational models of mechanisms (including representations) and processes. In this enterprise, a cognitive architecture is a domain-generic computational cognitive model that may be used for a broad multiple-level multiple-domain analysis of behaviour. It embodies generic descriptions of cognition in computer algorithms and programs. Developing cognitive architectures is a difficult but important task. In this paper, discussions of issues and challenges in developing cognitive architectures will be undertaken, and an example cognitive architecture (CLARION) will be described.
A call control driven MVC programming model for mixing web and call or multimedia applications
Authors: Stéphane H. Maes
Venue: Proceedings of the 4th international conference on mobile technology, applications, and systems and the 1st international symposium on Computer human interaction in mobile technology (2007)

With the evolution of internet towards web 2.0 and real time communications and the adoption of IMS by telecommunications service providers, SIP becomes the next major protocol that application developer may want to rely on to develop their latest applications. As SIP specifications stabilize, SIP application server become well understood entities. In fact most application servers, like J2EE, now support SIP servlet containers. As a result it become essential to understand how such SIP applications should interact with other web or IT applications. In this paper, we describe a call control driven MVC programming model for converged applications, defined as application that mix Web and SIP. The programming model is then generalized to any call or media control situation. As most telecommunications networks, in particular mobile network evolve towards the IMS, such programming model is expected to become essential to the development of future IMS mobile applications. It is in fact not limited to mobile, but extends to any application on network deploying IP (internet, broadband, wired and wireless with or without IMS as well as converged applications that provides a same experience across multiple such access networks). The programming model presented in this paper can be extended to rely on the notion of enabler, thereby supporting the combination of call control with other mobile, voice and communication features and the deployment over any network (IMS, SIP and other SIP deployments as well as legacy networks (e.g. PSTN and IN)).
BP-Mon: query-based monitoring of BPEL business processes
Authors: Catriel Beeri, Anat Eyal, Tova Milo, Alon Pilberg
Venue: ACM SIGMOD Record (2008)

A Business Process (BP for short) consists of some business activities undertaken by one or more organizations in pursuit of some particular goal. It often interacts with other BPs of the same or other organizations and the software implementing it is rather complex. Two complementary instruments facilitate the design, development, and management of this complex software. The first is the use of standards. In particular, the recent BPEL standard (Business Process Execution Language [5]) provides an XML-based language to describe the operational logic and execution flow of the BP, as well as the interfaces it exposes to other BPs. A BP specification written in BPEL can be automatically compiled into an actual code that implements the BP, and can be executed on a BPEL server. The second instrument is the use of supporting BP management tools for (1) designing the BP BPEL specifications, (2) analyzing the design, (3) monitoring the BPs at run time, and (4) analyzing, posteriorly, the process execution traces (logs). Together they provide an essential infrastructure for companies to design business processes, optimize them, reduce operational costs, and ultimately increase competitiveness.
Research on the Communicative Mobile English Learning Model
Authors: Jun Liu, Shengquan Yu, Min Ran
Venue: Proceedings of the Fifth IEEE International Conference on Wireless, Mobile, and Ubiquitous Technology in Education (2008)

The essence of “communicative mobile English learning mode” is to make full use of the ubiquitous language communicating environment created by mobile devices, and help students turn English learning activities into rich and colorful communicating activities. In this paper, a series of mobile device-based English communicating activities are designed, and corresponding practical research is conducted. By testing, questionnaire and interviews, we review the feasibility of the model and the effectiveness of mobile learning. Research has shown that this new learning model has positive effects in promoting primary school students’ interest towards English learning, as well as their mastery of knowledge and their development of abilities. In order to meet the future development of mobile English learning, suggestions and advice are provided in this paper.
Kinematic and dynamic model-based control of wheeled mobile manipulators: A unified framework for reactive approaches
Authors: V. Padois, J.-y. Fourquet, P. Chiron
Venue: Robotica (2007)

The work presented in this paper aims at providing a unified modelling framework for the reactive control of wheeled mobile manipulators (WMM). Where most work in the literature often provides models, sometimes simplified, of a given type of WMM, an extensive description of obtaining explicit kinematic and dynamic models of those systems is given. This modelling framework is particularly well suited for reactive control approaches, which, in the case of mobile manipulation missions, are often necessary to handle the complexity of the tasks to be fulfilled, the dynamic aspect of the extended workspace and the uncertainties on the knowledge of the environment. A flexible reactive framework is thus also provided, allowing the sequencing of operational tasks (in our case, tasks described in the end-effector frame) whose natures are different but also an on-line switching mechanism between constraints that are to be satisfied using the system redundancy. This framework has been successfully implemented in simulation and on a real robot. Some of the obtained results are presented.
A Method for the Formal Representation of the Boolean Conditions of Orchestrated Services
Authors: Corina Popescu, Jose L. Martinez Lastra
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications - Workshops (2008)

The focus of this research is formal validation and verification of the orchestration (the sequencing) of services. This approach uses a Petri net derived formalism called Timed Net Condition Event Systems (TNCES) which has been chosen due to its modular and composable nature. A basis of TNCES modules has been created to represent a set of eight constructs capable of expressing workflow-related features such as multithreading, synchronization, looping and sequencing. A separate bag of modules has been developed as an extension to the core set to enrich its modelling power with ability of describing Boolean and temporal conditions that may arise in conjunction with looping constructs. This paper focuses on the means of automatically generating each TNCES module within the auxiliary set. An example of possible interconnections between the basic types of modules of this set is provided in order to offer a small scale image of the envisioned validation framework.
Numerical expansion methods for solving systems of linear integral equations using interpolation and quadrature rules
Authors: Elçin Yusufoğlu
Venue: International Journal of Computer Mathematics (2007)

In this paper we introduce a numerical method for solving a system of linear integral equations. The main idea is based on the interpolations of unknown functions at some interpolation points chosen in advance. We then use Clenshaw-Curtis quadrature formulae to approximate the integrals appearing in the system of equations. The technique is very effective and simple, and the performance of this suggested method is illustrated by means of a few significant examples.
A Distributed Economic Meta-scheduler for the Grid
Authors: Kyle Chard, Kris Bubendorfer
Venue: Proceedings of the 2008 Eighth IEEE International Symposium on Cluster Computing and the Grid (2008)

In this paper we present DRIVE, a novel architecture for a Virtual Organization (VO) based distributed economic meta-scheduler in which members of the VO collaborativelyallocate Grid resources. Resource Providers joining the VO contribute Obligation services to the VO. These contributed services are in effect membership ’dues’ and are used in the running of the VO’s operations - allocation, advertising, management, etc. We use an auction plug-in mechanism to support arbitrary auction protocols which allows users to choose a protocol basedon speciﬁc requirements and infrastructural availability. For instance, within a single organization, where internal trust exists, users can achieve maximum allocation performance by choosing a conventional sealed bid auction plug-in. In a global utility Grid no such trust exists. The same meta-scheduler architecture can be used with a more expensive secure auction protocol plug-in which ensures the allocation is carried out fairly in the absence of trust. The DRIVE prototype has been implementedas a collection of standard WSRF Web services and includes a distributed implementation of a secure combinatorial Garbled Circuit protocol.
Dynamic route planning for car navigation systems using virus genetic algorithms
Authors: Hitoshi Kanoh
Venue: International Journal of Knowledge-based and Intelligent Engineering Systems (2007)

This paper describes a practical dynamic route planning method using real road maps in a wide area. The maps include traffic signals, road classes, and the number of lanes. The proposed solution is using a genetic algorithm adopting viral infection. The method is to use viruses as domain specific knowledge. A part of an arterial road is regarded as a virus. A population of viruses is generated in addition to a population of routes. Crossover and infection determine the near-optimal combination of viruses. When traffic congestion frequently changes during driving, an alternative route can be selected using viruses and other routes in the population in a real time. Experiments in dynamic environments using a real road map with 28000 cars show that the proposed method is superior to the Dijkstra algorithm for use in practical car navigation devices.
Distributed Top-K Query Processing in Wireless Sensor Networks
Authors: Demetrios Zeinalipour-Yazti, Zografoula Vagena
Venue: Proceedings of the The Ninth International Conference on Mobile Data Management (2008)

Wireless Sensor Networks create an innovative technology that enables users to monitor and study the physical world at an extremely high resolution. Query processing in such ad-hoc environments is a challenging task due to the complexities imposed by the inherent energy and communication constraints. To this end, the research community has proposed to take into account user-defined parameters in order to derive the K most relevant (or Top-K) answers quickly and efficiently. A Top-K query returns the subset of most relevant answers, in place of all answers, for two reasons: i) to minimize the cost metric that is associated with the retrieval of all answers; and ii) to improve the recall and the precision of the answer set, such that the user is not overwhelmed with irrelevant results.This tutorial presents the fundamental concepts behind distributed Top-K query processing and the adaptations of these algorithms to distributed and wireless sensor networks. It additionally provides a gentle overview of rudimentary and advanced techniques covering a significant body of research in this domain. The tutorial will start out with an overview of the most influential centralized and middleware Top-K query processing algorithms and then proceed with an elaborate description of distributed Top-K ranking algorithms for One-time Top-K Queries, Continuous Top-K Queries and Approximate Top-K Queries. Finally, it will provide an outlook to compelling future applications that can be constructed on the foundation of these algorithms. Although the tutorial is specifically geared towards Wireless Sensor Networks, many of the presented ideas find extensions in other mobile environments such as Adhoc Networks, Vehicular Networks and the Mobile Web.
A simple technique for fast digital background calibration of A/D converters
Authors: Francesco Centurelli, Pietro Monsurrò, Alessandro Trifiletti
Venue: EURASIP Journal on Advances in Signal Processing (2008)

A modification of the background digital calibration procedure for A/D converters by Li and Moon is proposed, based on a method to improve the speed of convergence and the accuracy of the calibration. The procedure exploits a colored random sequence in the calibration algorithm, and can be applied both for narrowband input signals and for baseband signals, with a slight penalty on the analog bandwidth of the converter. By improving the signal-to-calibration-noise ratio of the statistical estimation of the error parameters, our proposed technique can be employed either to improve linearity or to make the calibration procedure faster. A practical method to generate the random sequence with minimum overhead with respect to a simple PRBS is also presented. Simulations have been performed on a 14-bit pipeline A/D converter in which the first 4 stages have been calibrated, showing a 15 dB improvement in THD and SFDR for the same calibration time with respect to the original technique.
mCell: platform independent communication for small groups
Authors: Merja Haveri, Jan Blom, Jyri Virtanen, Mikko Tarkiainen, Jonna Häkkilä
Venue: Proceedings of the 9th international conference on Human computer interaction with mobile devices and services (2007)

In this paper, we describe the development and experiences with a mobile group communication application, mCell, that runs on a mobile phone. We present the underlying design implications, the application implementation, and a user study, where three groups used the application for one month. The findings of the user study reveal general user experiences with the application and show different patterns of usage depending on the social setting of the group, and how the preferred features vary accordingly.
Multivariate maximum entropy identification, transformation, and dependence
Authors: Nader Ebrahimi, Ehsan S. Soofi, Refik Soyer
Venue: Journal of Multivariate Analysis (2008)

This paper shows that multivariate distributions can be characterized as maximum entropy (ME) models based on the well-known general representation of density function of the ME distribution subject to moment constraints. In this approach, the problem of ME characterization simplifies to the problem of representing the multivariate density in the ME form, hence there is no need for case-by-case proofs by calculus of variations or other methods. The main vehicle for this ME characterization approach is the information distinguishability relationship, which extends to the multivariate case. Results are also formulated that encapsulate implications of the multiplication rule of probability and the entropy transformation formula for ME characterization. The dependence structure of multivariate ME distribution in terms of the moments and the support of distribution is studied. The relationships of ME distributions with the exponential family and with bivariate distributions having exponential family conditionals are explored. Applications include new ME characterizations of many bivariate distributions, including some singular distributions.