ppxscal/embedding_network huggingface dataset:
Pharmacokinetic Perfusion Curves Estimation for Liver Tumor Diagnosis from DCE-MRI
Authors: Liliana L. Caldeira, João M. Sanches
Venue: Proceedings of the 5th international conference on Image Analysis and Recognition (2008)

Dynamic-Contrast Enhanced MRI (DCE-MRI) is a method to analyze the perfusion dynamics in the tissues. The contrast agent concentration along the time, after the bolus injection, depends on the type of tissue observed, namely on its vascularization density and metabolic activity. The number of acquired volumes in this type of exam is usually very small, typically < 10, and the volumes are misaligned due to respiratory and cardiac activities.In this paper an algorithm to automatically characterize the malignancy of the tumor is presented based on the perfusion curves on each voxel of the tumor, obtained from DCE-MRI. A non-rigid registration procedure based on Mutual Information (MI) criterion is used to align the small volumes representing the region of interest (ROI) containing the tumor along the time. A pharmacokinetic (PK) third order linear model is estimated from the observations and its parameters are used to classify the malignancy of tumor.
Towards Simulation-Based Quality Requirements Elicitation: A Position Paper
Authors: Roland Kaschek, Christian Kop, Vladimir A. Shekhovtsov, Heinrich C. Mayr
Venue: Proceedings of the 14th international conference on Requirements Engineering: Foundation for Software Quality (2008)

The future users of a system under development are not necessarily good at talking about the quality they require of that system if they cannot yet experience it. We therefore propose to support them by a simulation of the system under development thus allowing them to experience and validate system quality. Requirements are supposed to be expressed in a user-centered glossary-based semantic model.
Comparative and evolutionary analysis of cellular pathways
Authors: Richard M. Karp
Venue:  (2007)

Various pathways maintain the structure, function and health of a cell, and intricate molecular mechanisms underlie these cellular pathways. Inquiring how such mechanisms could have evolved is a basic question in evolutionary biology with wide-ranging implications for predicting and altering cellular phenotypes. This dissertation presents our work on the computational analysis of genome-level data (on biomolecular sequences and interactions) available for many organisms to study the conservation and evolution of cellular pathways. We study conservation of pathways in the context of comparative analysis of protein interaction networks. We specifically present a method based on a graph-matching algorithm to detect conserved pathways between two protein networks. Our algorithm is provably efficient unlike the search heuristics used in previous methods, and is novel in the broader field of graph-matching as well. We apply the method to compare the yeast network with the human, fruit fly and nematode worm networks, evaluate the detected conserved pathways using known yeast protein complexes, and demonstrate applications to function prediction. We study evolution of pathways in the context of phylogenetic analysis of bacterial and archaeal pathways. We specifically present a tractable probabilistic model for pathway evolution that makes the assumptions about pathway evolution explicit, in contrast to the few past studies that use discrete pathway similarity based models. We then apply the model to estimate the phylogeny along which a pathway such as citric acid cycle or chemotaxis evolved from its unknown ancestral forms to extant forms. We interpret the estimated phylogenies of such pathways involved in essential metabolisms or stress responses using known species phylogenies and published cellular phenotypes.
Topincs Wiki --- A Topic Maps Powered Wiki
Authors: Robert Cerny
Venue: Scaling Topic Maps: Third International Conference on Topic Maps Research and Applications, TMRA 2007 Leipzig, Germany, October 11-12, 2007 Revised Selected Papers (2008)

Topincs provides a RESTful web service interface for retrieval and manipulation of topic maps. A Topincs Server implementing the interface can host many stores, which are collections of topic maps. The Topincs Editor is a browser-based application that allows editing of topic maps. In this paper, the Topincs Wiki, another view on the content of a Topincs Store, is presented. Its purpose is to hide the Topic Maps paradigm from the user, thus simplifying the collaborative creation of topic maps. The Wiki still emphasizes formal statements. It uses ontological reflection to guide users to data conformity rather than enforcing it with a schema. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Compromised Sensor Nodes Detection: A Quantitative Approach
Authors: Tao Li, Min Song, Mansoor Alam
Venue: Proceedings of the 2008 The 28th International Conference on Distributed Computing Systems Workshops (2008)

In a wireless sensor network, an adversary may crack legal nodes or deploy malicious nodes to launch various attacks. These nodes are collectively called compromised nodes. In this paper, we define a Data Transmission Quality (DTQ) function to differentiate the legitimate nodes and compromised nodes. The DTQ function is defined in a way that it will keep close to constant or change smoothly for legitimate nodes and will keep decreasing for suspicious nodes. The final decision of whether or not a suspicious node is compromised is determined by a group voting procedure. Simulations were conducted to verify the effectiveness of the design.
Motion-aware self-localization for underwater networks
Authors: Diba Mirza, Curt Schurgers
Venue: Proceedings of the third ACM international workshop on Underwater Networks (2008)

A myriad of ocean processes affect life on the planet and are a source of intrigue to oceanographers and scientists. Understanding these processes and their interactions with currents requires collection of relevant data. A network of mobile platforms can be used to learn the correlation of processes in space and over time. To do this, data samples collected by nodes have to be annotated with location information. Given limited access to Global Positioning Systems underwater, collaborative self-localization schemes applied periodically are well-suited for this purpose. However, the specific nature of the underwater acoustic environment introduces significant error during network self-localization due to the combined effect of large latencies in communication and node mobility. We propose a method to account for these effects thus significantly improving the accuracy of position estimates.
GeoContest
Authors: Nils B. Weidmann, Lars-Erik Cederman
Venue: Social Science Computer Review (2008)

The authors present GeoContest, a modeling framework for geopolitical competition among states. Building on the Geosim model, GeoContest models the evolution of state systems through conquest. However, instead of hard wiring the strategic behavior of states, GeoContest allows for their decision-making mechanism to be plugged into the simulation as a module. Thus, experiments with states' strategic behavior can be performed. This article gives a nontechnical introduction to GeoContest, outlining the design and illustrating application. The authors start with tournaments using simple aggressive and peaceful strategies showing that greed for conquest does not pay off and successful attackers have to carefully examine their own and the opponents' capabilities. They also demonstrate that relying on nonaggression pacts can successfully compete against a cautious aggressor strategy. In a final series of experiments, the authors examine the question of whether artificial state actors overestimating their military capabilities have a selective advantage in the international competition, as suggested in the literature.
Performance Evaluation of the Optimal Hierarchy for Cellular Networks
Authors: So-Jeong Park, Gyung-Leen Park, In-Hye Shin, Junghoon Lee, Ho Young Kwak, Do-Hyeon Kim, Sang Joon Lee, Min-Soo Kang
Venue: Proceedings of the 7th international conference on Computational Science, Part IV: ICCS 2007 (2007)

Reducing the location update cost has been a critical research issue since the location update process requires heavy signaling traffics. One of the solutions is employing the hierarchical structure in cellular networks to reduce the location update cost. This paper is not only to measure the average location update cost in cellular networks using the hierarchical structure but also to determine the degree of the hierarchy which minimizes the location update cost. The paper proposes an advanced analytical model to obtain the optimal hierarchy in cellular networks, considering the update rates of the two registers, HLR and VLR, as well as the update delays for them. Also, the paper provides the threshold values as a guideline for the network administrator to design the optimal hierarchical structure in cellular networks.
Input-to-State Stabilization with Quantized Output Feedback
Authors: Yoav Sharon, Daniel Liberzon
Venue: Proceedings of the 11th international workshop on Hybrid Systems: Computation and Control (2008)

We study control systems where the output subspace is covered by a finite set of quantization regions, and the only information available to a controller is which of the quantization regions currently contains the system's output. We assume the dimension of the output subspace is strictly less than the dimension of the state space. The number of quantization regions can be as small as 3 per dimension of the output subspace. We show how to design a controller that stabilizes such a system, and makes the system robust to an external unknown disturbance in the sense that the closed-loop system has the Input-to-State Stability property. No information about the disturbance is required to design the controller. Achieving the ISS property for continuous-time systems with quantized measurements requires a hybrid approach, and indeed our controller consists of a dynamic, discrete-time observer, a continuous-time state-feedback stabilizer, and a switching logic that switches between several modes of operation. Except for some properties that the observer and the stabilizer must possess, our approach is general and not restricted to a specific observer or stabilizer. Examples of specific observers that possess these properties are included.
Zhang Neural Network Versus Gradient Neural Network for Online Time-Varying Quadratic Function Minimization
Authors: Yunong Zhang, Zhan Li, Chenfu Yi, Ke Chen
Venue: Proceedings of the 4th international conference on Intelligent Computing: Advanced Intelligent Computing Theories and Applications - with Aspects of Artificial Intelligence (2008)

With the proved efficacy on solving linear time-varying matrix or vector equations, Zhang neural network (ZNN) could be generalized and developed for the online minimization of time-varying quadratic functions. The minimum of a time-varying quadratic function can be reached exactly and rapidly by using Zhang neural network, as compared with conventional gradient-based neural networks (GNN). Computer-simulation results substantiate further that ZNN models are superior to GNN models in the context of online time-varying quadratic function minimization.
Application of Aggregated Knowledge Concept in Automatic Knowledge Acquisition from Chinese Web Pages
Authors: Haiyan Che, Jigui Sun, Xi Bai, Lian Shi
Venue: Proceedings of the 2008 International Symposiums on Information Processing (2008)

Proper ontology definition is the prerequisite for efficient knowledge acquisition. For the complex knowledge that could not be described by simple binary relation, we advocated a methodology for aggregated knowledge acquisition, describing how to define the ontology for such aggregated knowledge concept and how to acquire knowledge basing on such definition. Experiment shows that this methodology is effective in automatic knowledge acquisition from Chinese free text.
RT-Link: A global time-synchronized link protocol for sensor networks
Authors: Anthony Rowe, Rahul Mangharam, Raj Rajkumar
Venue: Ad Hoc Networks (2008)

For real-time wireless communication in industrial control, surveillance and inventory tracking, we propose RT-Link, a time-synchronized link protocol. RT-Link provides predictable lifetime for battery-operated embedded nodes, bounded end-to-end delay across multiple hops, and collision-free operation. We investigate the use of hardware-based time-synchronization for infrastructure nodes by using an AM carrier-current radio for indoors and atomic clock receivers for outdoors. Mobile nodes are synchronized via in-band software synchronization within the same framework. Through the design and deployment of RT-Link, we identify three key observations: (a) Hardware-based global time-synchronization is a robust and scalable option to in-band software-based techniques. (b) Achieving global time-synchronization is both economical and convenient for indoor and outdoor deployments. (c) RT-Link achieves a practical lifetime of over 2 years. By analysis and simulation, we show that RT-Link outperforms energy-efficient low-power-listen CSMA protocols in terms of node lifetime and end-to-end latency. The protocol supports flexible services such as on-demand end-to-end rate control and logical topology control. We implemented RT-Link on the CMU FireFly sensor platform as a link layer running on the Nano-RK real-time sensor OS. We also discuss deployment experiences using RT-Link in a coal mine safety application.
Recognizing Affective Dimensions from Body Posture
Authors: Andrea Kleinsmith, Nadia Bianchi-Berthouze
Venue: Proceedings of the 2nd international conference on Affective Computing and Intelligent Interaction (2007)

The recognition of affective human communication may be used to provide developers with a rich source of information for creating systems that are capable of interacting well with humans. Posture has been acknowledged as an important modality of affective communication in many fields. Behavioral studies have shown that posture can communicate discrete emotion categories as well as affective dimensions. In the affective computing field, while models for the automatic recognition of discrete emotion categories from posture have been proposed, to our knowledge, there are no models for the automatic recognition of affective dimensions from static posture. As a continuation of our previous study, the two main goals of this study are: i) to build automatic recognition models to discriminate between levels of affective dimensions based on low-level postural features; and ii) to investigate both the discriminative power and the limitations of the postural features proposed. The models were built on the basis of human observers' ratings of posture according to affective dimensions directly (instead of emotion category) in conjunction with our posture features.
Weak Signal Detection Method Based on Sector Spatial Pre-filtering
Authors: Dahai Zhang, Yuanliang Ma, Kunde Yang, Yue Pan
Venue: Proceedings of the 2008 Congress on Image and Signal Processing, Vol. 5 - Volume 05 (2008)

A new approach for local area weak signal detection is presented. Sector spatial pre-filtering and image part high resolution algorithms were used in this method. The steps are: firstly, received data of array is pre-filtered by sector spatial filter. Secondly, according to the character of the noise field filtered, image-part high resolution algorithm is used to scan the local area. Then, the signals azimuths are estimated by the spectrum of signals. Computer simulation invited availability of this approach.
Resource Management and Signalling Architecture of a Hybrid Multicast Service for Multimedia Distribution
Authors: Eugen Borcoci, António Pinto, Ahmed Mehaoua, Li Fang, Ning Wang
Venue: Proceedings of the 11th IFIP/IEEE international conference on Management of Multimedia and Mobile Networks and Services: Management of Converged Multimedia Networks and Services (2008)

This paper further develops an architecture and design elements for a resource management and a signalling system to support the construction and maintenance of a mid-long term hybrid multicast tree for multimedia distribution services in a QoS guaranteed way, over multiple IP domains. The system called E-cast is composed of an overlay part --- in inter-domain and possible IP level multicast in intra-domain. Each E-cast tree is associated with a given QoS class and is composed of unicast pipes established through Service Level Specification negotiations between the domain managers. The paper continues a previous work, by proposing an inter-domain signalling system to support the multicast management and control operations and then defining the resource management for tree construction and adjustment procedures in order to assure the required static and dynamic properties of the tree.
Reducing Packet Dropping in a Bufferless NoC
Authors: Crispín Gómez, María E. Gómez, Pedro López, José Duato
Venue: Proceedings of the 14th international Euro-Par conference on Parallel Processing (2008)

Networks on chip (NoCs) has a strong impact on overall chip performance. Interconnection bandwidth is limited by the critical path delay. Recent works show that the critical path includes the switch input buffer control logic. As a consequence, by removing buffers, switch clock frequency can be doubled. Recently, a new switching technique for NoCs called Blind Packet Switching (BPS) has been proposed. It is based on replacing the buffers of the switch ports by simple latches. Since buffers consume a high percentage of switch power and area, BPS not only improves performance but also helps in reducing power and area. In BPS there are no buffers at the switch ports, so packets can not be stopped. If the required output port is busy, the packet will be dropped. In order to prevent packet dropping, some techniques based on resource replication has been proposed. In this paper, we propose some alternative and complementary techniques that does not rely on resource replication. By using these techniques, packet dropping and its negative effects are highly reduced. In particular, packet dropping is completely removed for a very wide network traffic range. The first dropped packet appears at a 11.6 higher traffic load. As a consequence, network throughput is increased and the packet latency is kept almost constant.
Self-Guided Genetic Algorithm
Authors: Shih-Hsin Chen, Pei-Chann Chang, Qingfu Zhang
Venue: Proceedings of the 4th international conference on Intelligent Computing: Advanced Intelligent Computing Theories and Applications - with Aspects of Artificial Intelligence (2008)

This paper proposed a new algorithm, termed as Self-Guided genetic algorithm, which is one of the algorithms in the category of evolutionary algorithm based on probabilistic models (EAPM). Previous EAPM research explicitly used the probabilistic model from the parental distribution, then generated solutions by sampling from the probabilistic model without using genetic operators. Although EAPM is promising in solving different kinds of problems, Self-Guided GA doesn't intend to generate solution by the probabilistic model directly because the time-complexity is high when we solve combinatorial problems, particularly the sequencing ones. As a result, the probabilistic model serves as a fitness surrogate which estimates the fitness of the new solution beforehand in this research. So the probabilistic model is used to guide the evolutionary process of crossover and mutation. This research studied the single machine scheduling problems and the corresponding experiment were conducted. From the results, it shows that the Self-Guided GA outperformed other algorithms significantly. In addition, Self-Guided GA works more efficiently than previous EAPM. As a result, it could be a break-through in the branch of EAPM.
A Wide Neighborhood Primal-Dual Interior-Point Algorithm for a Class of Convex Programming
Authors: Yuqin Zhao, Mingwang Zhang
Venue: Proceedings of the 4th international conference on Intelligent Computing: Advanced Intelligent Computing Theories and Applications - with Aspects of Artificial Intelligence (2008)

This paper presents a new primal-dual interior-point algorithm with reduced potential function for a class of convex programming, based on the ideas of that method for solving linear programming. The new algorithm chooses the classical Newton direction as iteration direction and its iteration stepsize is determined by potential function. As the search directions Δx and Δs aren't orthogonal any more, the complexity analysis of this method is different from that of linear programming, correspondingly. Under a scaled Lipschitz condition, the algorithm is proved to possess O(nL) iteration-complexity bounds
Content or context?: searching for musical meaning in task-based interactive information retrieval
Authors: Charlie Inskip, Andy MacFarlane, Pauline Rafferty
Venue: Proceedings of the second international symposium on Information interaction in context (2008)

Creative professionals search for digital music to accompany moving images using interactive information retrieval systems run by music publishers and record companies. This research-in-progress investigates creative professionals and intermediaries communication processes and information seeking and use behaviour with a view to making recommendations to information retrieval systems builders about the relative importance of content and contextual factors. A communications model is used to suggest that the meaning of music is determined by its listener and use context, as well as cultural codes and competences.
A New Particle Swarm Optimization Algorithm and Its Convergence Analysis
Authors: Zihui Ren, Jian Wang, Huizhe Zhang
Venue: Proceedings of the 2008 Second International Conference on Genetic and Evolutionary Computing (2008)

This paper modified the structure of the original PSO algorithm. It proposes that the particles' position have relationship with the one particle's and the whole swarm's perceive extent in the processing of this time and last time, and presents the inertial weight based on simulated annealing temperature. So a new Particle Swarm Optimization algorithm (NPSO) is proposed. It can not improve the one particle's and the whole swarm's perceivable extent and improve the searching efficient but also increase variety of particles and overcome the defect of sinking the local optimal efficiently. At the same time we give the convergence condition of this new algorithm. The algorithm of PSO and NPSO and LPSO are tested with four well-known benchmark functions. The experiments show that the convergence speed of NPSO is significantly superior to PSO and LPSO. The convergence accuracy is increased.