ppxscal/embedding_network huggingface dataset:
Global functional profiling using onto-express: design and implementation
Authors: Sorin Draghici
Venue:  (2006)

Typical result of a microarray experiment is a list of tens or hundreds of genes found to be differentially regulated in the condition under study. Independent of the methods used to select these genes, the common task faced by any researcher is to translate these lists of genes into a better understanding of the biological phenomena involved. Currently, this is done through a tedious combination of literature searches and public databases browsing. We developed Onto-Express as a novel tool able to automatically translate such lists of differentially regulated genes into functional profiles characterizing the impact of the condition studied. OE constructs functional profiles (using Gene Ontology terms) for the following categories: biological process, cellular component, molecular function and chromosome location.
Strela-1, the First Soviet Computer: Political Success and Technological Failure
Authors: Hiroshi Ichikawa
Venue: IEEE Annals of the History of Computing (2006)

Which computer was developed first in the Soviet Union? Which one was first successful? Suchquestions are difficult to answer, but recently declassified archival material may hold the key. Thestory of the Strela illustrates how competing interestsas institutions and factions jockeyed to gainpolitical advantage-helped determine the fate of this computer, a political success but atechnological failure.
Understanding Linux Network Internals
Authors: Christian Benvenuti
Venue:  (2005)

If you've ever wondered how Linux carries out the complicated tasks assigned to it by the IP protocols -- or if you just want to learn about modern networking through real-life examples -- Understanding Linux Network Internals is for you. Like the popular O'Reilly book, Understanding the Linux Kernel, this book clearly explains the underlying concepts and teaches you how to follow the actual C code that implements it. Although some background in the TCP/IP protocols is helpful, you can learn a great deal from this text about the protocols themselves and their uses. And if you already have a base knowledge of C, you can use the book's code walkthroughs to figure out exactly what this sophisticated part of the Linux kernel is doing.Part of the difficulty in understanding networks -- and implementing them -- is that the tasks are broken up and performed at many different times by different pieces of code. One of the strengths of this book is to integrate the pieces and reveal the relationships between far-flung functions and data structures. Understanding Linux Network Internals is both a big-picture discussion and a no-nonsense guide to the details of Linux networking. Topics include:Key problems with networkingNetwork interface card (NIC) device driversSystem initializationLayer 2 (link-layer) tasks and implementationLayer 3 (IPv4) tasks and implementationNeighbor infrastructure and protocols (ARP)BridgingRoutingICMPAuthor Christian Benvenuti, an operating system designer specializing in networking, explains much more than how Linux code works. He shows the purposes of major networking features and the trade-offs involved in choosing one solution over another. A large number of flowcharts and other diagrams enhance the book's understandability.
Similarity Search Using Sparse Pivots for Efficient Multimedia Information Retrieval
Authors: Nieves R. Brisaboa, Antonio Farina, Oscar Pedreira, Nora Reyes
Venue: Proceedings of the Eighth IEEE International Symposium on Multimedia (2006)

Similarity search is a fundamental operation for applications that deal with unstructured data sources. In this paper we propose a new pivot-based method for similarity search, called Sparse Spatial Selection (SSS). This method guarantees a good pivot selection more efficiently than other methods previously proposed. In addition, SSS adapts itself to the dimensionality of the metric space we are working with, and it is not necessary to specify in advance the number of pivots to extract. Furthermore, SSS is dynamic, it supports object insertions in the database efficiently, it can work with both continuous and discrete distance functions, and it is suitable for secondary memory storage. In this work we provide experimental results that confirm the advantages of the method with several vector and metric spaces.
Autonomous interactive intermediaries: social intelligence for mobile communication agents
Authors: Christopher M. Schmandt
Venue:  (2005)

Today's cellphones are passive communication portals. They are neither aware of our conversational settings, nor of the relationship between caller and callee, and often interrupt us at inappropriate times. This thesis is about adding elements of human style social intelligence to our mobile communication devices in order to make them more socially acceptable to both user and local others. I suggest the concept of an Autonomous Interactive Intermediary that assumes the role of an actively mediating party between caller, callee, and co-located people. In order to behave in a socially appropriate way, the Intermediary interrupts with non-verbal cues and attempts to harvest 'residual social intelligence' from the calling party, the called person, the people close by, and its current location. For example, the Intermediary obtains the user's conversational status from a decentralized network of autonomous body-worn sensor nodes. These nodes detect conversational groupings in real time, and provide the Intermediary with the user's conversation size and talk-to-listen ratio. The Intermediary can 'poll' all participants of a face-to-face conversation about the appropriateness of a possible interruption by slightly vibrating their wirelessly actuated finger rings. Although the alerted people do not know if it is their own cellphone that is about to interrupt, each of them can veto the interruption anonymously by touching his/her ring. If no one vetoes, the Intermediary may interrupt. A user study showed significantly more vetoes during a collaborative group-focused setting than during a less group oriented setting. The Intermediary is implemented as a both a conversational agent and an animatronic device. The animatronics is a small wireless robotic stuffed animal in the form of a squirrel, bunny, or parrot. The purpose of the embodiment is to employ intuitive non-verbal cues such as gaze and gestures to attract attention, instead of ringing or vibration. Evidence suggests that such subtle yet public alerting by animatronics evokes significantly different reactions than ordinary telephones and are seen as less invasive by others present when we receive phone calls. The Intermediary is also a dual conversational agent that can whisper and listen to the user, and converse with a caller, mediating between them in real time. The Intermediary modifies its conversational script depending on caller identity, caller and user choices, and the conversational status of the user. It interrupts and communicates with the user when it is socially appropriate, and may break down a synchronous phone call into chunks of voice instant messages. (Copies available exclusively from MIT Libraries, Rm. 14-0551, Cambridge, MA 02139-4307. Ph. 617-253-5668; Fax 617-253-1690.)
MMSE Filtering of generalised signal-dependent noise in spatial and shift-invariant wavelet domains
Authors: Fabrizio Argenti, Gionatan Torricelli, Luciano Alparone
Venue: Signal Processing (2006)

This paper addresses the topic of filtering digital images corrupted by signal-dependent additive white noise. The noise model is fully parametric to take into account different noise generation processes, like speckle and film-grain noise. Noise reduction is first approached as a linear minimum mean square error estimation in the spatial domain, thus extending previous results to the most general signal-dependent white noise model. The same type of estimation is performed in a shift-invariant wavelet domain, in which the absence of decimation of the decomposition avoids the typical ringing/aliasing impairments of critically subsampled wavelet-based denoising schemes. In the former case, filtered pixel values are obtained as adaptive combinations of raw and of local average values, driven by locally computed statistics. In the latter case, detail wavelet coefficients of the noisy image are adaptively shrunk by using local statistics derived from the noisy image and the noise model, before the denoised image is synthesised. Experimental results demonstrate that the proposed approaches take full advantage of the knowledge of the underlying noise model. Furthermore, the multiresolution algorithm steadily outperforms the spatial counterpart in terms of both SNR increment and of enhancement in visual quality.
The two-edge connected hop-constrained network design problem: Valid inequalities and branch-and-cut
Authors: David Huygens, Martine Labbé, A. Ridha Mahjoub, Pierre Pesneau
Venue: Networks (2007)

This article deals with the Two-edge connected Hop-constrained Network Design Problem (or THNDP for short). Given a weighted graph G = (N,E), an integer L &ge; 2, and a subset of pairs of nodes D, the problem consists of finding the minimum cost subgraph in G containing at least two edge-disjoint paths of at most L hops between all the pairs in D. First, we show that the THNDP is strongly NP-hard even when the demands in D are rooted at some node s and the costs are unitary. However, if the graph is complete, we prove that the problem in this case can be solved in polynomial time. We give an integer programming formulation of the problem in the space of the design variables when L = 2, 3. Then we study the associated polytope. In particular, we consider the case where all the pairs of nodes of D are rooted at a node s. We give several classes of valid inequalities along with necessary and&sol;or sufficient conditions for these inequalities to be facet defining. We also derive separation routines for these inequalities. We finally develop a branch-and-cut algorithm based on these results and discuss some computational results for L = 2, 3. &copy; 2006 Wiley Periodicals, Inc. NETWORKS, Vol. 49(1), 116&ndash;133 2007
The mean subjective utility score, a novel metric for cost-sensitive classifier evaluation
Authors: Ross A. McDonald
Venue: Pattern Recognition Letters (2006)

A simple solution is proposed to the problem of conveying a classifier's performance to a universal standard when misclassification costs are not equal. An application of this metric in the field of boosting is briefly described.
A model of surround suppression through cortical feedback
Authors: Thomas J. Sullivan, Virginia R. de Sa
Venue: Neural Networks (2006)

Surround suppression occurs when a visual stimulus outside a neuron's classical receptive field causes a reduction in firing rate. It has become clear that several mechanisms are working together to induce center-surround effects such as surround suppression. While several models exist that rely on lateral connections within V1 to explain surround suppression, few have been proposed that show how cortical feedback might play a role. In this work, we propose a theory in which reductions in excitatory feedback contribute to a neuron's suppressed firing rate. We also provide a computational model that incorporates this idea.
Worst case burstiness increase due to arbitrary aggregate multiplexing
Authors: Juan Echagüe, Vicent Cholvi
Venue: Proceedings of the 1st international conference on Performance evaluation methodolgies and tools (2006)

As a means of supporting quality of service guarantees, aggregate multiplexing has attracted a lot of attention in the networking community, since it requires less complexity than flow-based scheduling. However, contrary to what happens in the case of flow-based multiplexing, few results are available for aggregate-based multiplexing.In this paper, we consider a server multiplexer fed by several flows and analyze the impact caused by traffic aggregation on the flows at the output of the server. No restriction is imposed on the server multiplexer other than the fact that it must operate in a work-conserving fashion.We characterize of the best arrival curves that constrain the number of bits that leave the server, in any time interval, for each individual flow. These curves can be used to obtain the delays suffered by packets in complex scenarios where multiplexers are interconnected, as well as to determine the maximum size of the buffers in the different servers.Previous results provide tight delay bounds for networks where servers are of the FIFO type. Here, we provide tight bounds for any work-conserving scheduling policy, so that our results can be applied to heterogeneous networks where the servers (routers) can use different work-conserving scheduling policies such as First-In First-Out (FIFO), Earliest Deadline First (EDF), Strict Priority (SP), Guaranteed Rate scheduling (GR), etc.
Using mixed VR/AR technologies in education
Authors: Dorin Mircea Popovici, Luca-Dan Serbcanati
Venue: Proceedings of the International Multi-Conference on Computing in the Global Information Technology (2006)

In this paper, we describe an ongoing project dedicated to kindergarten children. By invoking a narrative context, we propose to children an AR-based virtual environment within which they are expecting to learn by playing each other, as they are doing in a real context. The proposed subjects for the educational contexts are selected by the teacher, and the children are let to improvise in order to attend the conclusion. The implementation of the system is based on ARéVi API for visual rendering, ARToolkit for interaction support, and classical client-server architecture for the environment distribution between several classrooms.
Category-Specific Semantic Deficits in Focal and Widespread Brain Damage: A Computational Account
Authors: Joseph T. Devlin, Laura M. Gonnerman, Elaine S. Andersen, Mark S. Seidenberg
Venue: Journal of Cognitive Neuroscience (1998)

Category-specific semantic impairments have been explained in terms of preferential damage to different types of features (e.g., perceptual vs. functional). This account is compatible with cases in which the impairments were the result of relatively focal lesions, as in herpes encephalitis. Recently, however, there have been reports of category-specific impairments associated with Alzheimer's disease, in which there is more widespread, patchy damage. We present experiments with a connectionist model that show how "category-specific" impairments can arise in cases of both localized and wide spread damage; in this model, types of features are topographically organized, but specific categories are not. These effects mainly depend on differences between categories in the distribution of correlated features. The model's predictions about degree of impairment on natural kinds and artifacts over the course of semantic deterioration are shown to be consistent with existing patient data. The model shows how the probabilistic nature of damage in Alzheimer's disease interacts with the structure of semantic memory to yield different patterns of impairment between patients and categories over time.
"IMS in a Bottle": Initial Experiences from an OpenSER-based Prototype Implementation of the 3GPP IP Multimedia Subsystem
Authors: Joachim Fabini, Norbert Jordan, Peter Reichl, Alexander Poropatich, Rainer Huber
Venue: Proceedings of the International Conference on Mobile Business (2006)

The 3GPP IP Multimedia Subsystem (IMS) is currently expected to provide the basic architecture framework for the Next Generation Network which will bridge the traditional divide between circuit-switched and packet-switched networks and consolidate both sides into one single network for all services. Therefore, the imminent commercial roll-out of IMS will have immense impact on the whole way future mobile business applications are designed, developed and deployed. This paper presents a survey about the application-oriented research project CAMPARI (Configuration, Architecture, Migration, Performance Analysis and Requirements of 3G IMS) which aims at inves-tigating a "minimal-optimal" IMS configuration with respect to architecture and Quality-of-Service aspects. After a brief survey of the IMS core components, we introduce our OpenSER-based IMS prototype implementation and pre-sent the "IMS in a bottle" approach. Based on our practical experiences with this testbed system, we finally discuss important current and future challenges including migration, interworking, charging, identity management, security, and regulatory aspects.
Faces and Facial Features Detection in Color Images
Authors: Mohamed A. Berbar, Hamdy M. Kelash, Amany A. Kandeel
Venue: Proceedings of the conference on Geometric Modeling and Imaging: New Trends (2006)

Human face detection is concerned with finding the location and size of every human face in a given image. Face detection plays a very important role in human computer interaction field. It represents the first step in a fully automatic face re cognition, facial features detection, and expression recognition. There are many techniques used in face detection, each one has its advantages and disadvantages. The face detection system presented in this paper is a hybrid of known algorithms. First stag e of the proposed method is applying skin detection algorithm to specify all skin locations in the image. Second, extract face features like eyes, mouth and nose. At the last, a verification step is applied to ensure that the extracted features are facial features. In experiments on images having upright frontal faces with any background our system has achieved high detection rates and low false positives.
RETRACTED: Matching pursuit-based approach for ultrasonic flaw detection
Authors: N. Ruiz-Reyes, P. Vera-Candeas, J. Curpián-Alonso, J. C. Cuevas-Martinez, F. López-Ferreras
Venue: Signal Processing (2006)

This article has been retracted at the request of the Editor-in-Chief and Publisher. Please see http://www.elsevier.com/locate/withdrawalpolicy. Reason: This article is virtually identical to the previously published article: ''New matching pursuit-based algorithm for SNR improvement in ultrasonic NDT'', Independent Nondestructive Testing and Evaluation International, volume 38 (2005) 453-458 authored by N. Ruiz-Reyes, P. Vera-Candeas, J. Curpian-Alonso, R. Mata-Campos and J.C. Cuevas-Martinez.
Magenta technology multi-agent logistics i-Scheduler for road transportation
Authors: Jonathan Himoff, George Rzevski, Petr Skobelev
Venue: Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems (2006)

The paper describes main features of an Intelligent Scheduler for Road Transportation Applications based on Magenta agent technology and characterized by a number of unique, advanced features such as real-time, incremental, continuous scheduling and schedule improvement, scalability from small to very large enterprise networks, multi-criteria schedule analysis and rich decision support for the user, pro-active agent negotiations.The scheduler is event driven, which means that it construct schedules taking into account the occurrence of all schedule affecting events (such as the arrival of a new order, order cancellation, truck failure, road unavailability and driver no-show). As an event occurs the scheduler rapidly re-schedules only the affected part of the schedule thus causing the minimum disruption to already allocated resources.The Scheduler has been tested on real data supplied by several UK Road Logistics operators.The Scheduler was developed using protected Magenta technology for agent negotiations in virtual environment and knowledge discovery.
Time-frequency representations-based detector of chaos in oscillatory circuits
Authors: Vesna Rubežić, Igor Djurović, Miloš Daković
Venue: Signal Processing (2006)

Detection of chaotic states in the nonlinear chaotic Chua's oscillatory circuit has been considered. A new approach, based on the concentration measure of the time-frequency (TF) representation, is proposed for determination of the current circuit state. Parameters of the proposed algorithm are studied in details. The algorithm is applied in the case of moderate noisy signal, as well as for breaking a chaotic communication scheme.
Mathematical Analysis of Diabetes Related Proteins Having High Sequence Complexity
Authors: Allam Appa Rao, Bhremeramba, GR Sridhar
Venue: Proceedings of the 18th IEEE International Conference on Tools with Artificial Intelligence (2006)

We have searched for proteins affecting diabetes and we also found in which common species these proteins were more prevalent and have performed protein composition analysis of those having high sequence complexity. About 90% of rat genes have counterparts in the mouse and human genomes and this is the reason to find proteins common among the three different species.(Rat Genome Sequencing Consortium 2004, www.ratbehaviour.org/Ratsmice.htm) The distribution pattern of the protein variates was examined and bivariate plots were further drawn. The bivariate plots show a similar clustering for Rattus norvegicus and Mus Musculus but show some variation in Homo sapiens indicating that the plots are correct as Rattus Norvegicus and Mus Musculus are relatively close in the phylogenetic tree(Sridhar GR etal) hence having a similar clustering. The proteins which are away from the cluster are outliers due to the reason that they are having different compositional characteristics.
G-lambda: coordination of a grid scheduler and lambda path service over GMPLS
Authors: Atsuko Takefusa, Michiaki Hayashi, Naohide Nagatsu, Hidemoto Nakada, Tomohiro Kudoh, Takahiro Miyamoto, Tomohiro Otani, Hideaki Tanaka, Masatoshi Suzuki, Yasunori Sameshima, Wataru Imajuku, Masahiko Jinno, Yoshihiro Takigawa, Shuichi Okamoto, Yoshio Tanaka, Satoshi Sekiguchi
Venue: Future Generation Computer Systems (2006)

At iGrid2005, we conducted a live demonstration where our Grid scheduling system co-allocated computing and network resources with advance reservation through Web services interfaces using the Grid Resource Scheduler (GRS), the Network Resource Management System (NRM), which is capable of GMPLS network resource management, and a GMPLS-based network test-bed, for the first time. The goal of the G-lambda project is to define a standard Web services interface (GNS-WSI) between GRS and NRM that is acceptable for both application service providers and commercial network operators, and which can be used as a tool for realizing new and emerging commercial services.
Pedestrian Detection and Tracking for Counting Applications in Crowded Situations
Authors: Oliver Sidla, Yuriy Lypetskyy, Norbert Brandle, Stefan Seer
Venue: Proceedings of the IEEE International Conference on Video and Signal Based Surveillance (2006)

This paper describes a vision based pedestrian detection and tracking system which is able to count people in very crowded situations like escalator entrances in underground stations. The proposed system uses motion to compute regions of interest and prediction of movements, extracts shape information from the video frames to detect individuals, and applies texture features to recognize people. A search strategy creates trajectories and new pedestrian hypotheses and then filters and combines those into accurate counting events. We show that counting accuracies up to 98 % can be achieved.