ppxscal/embedding_network huggingface dataset:
Local Topology Assisted XOR Coding in Wireless Mesh Networks
Authors: Rajesh Prasad, Hongyi Wu, Dmitri Perkins, Nian-Feng Tzeng
Venue: Proceedings of the 2008 The 28th International Conference on Distributed Computing Systems Workshops (2008)

Network coding has shown great potential to improve the overall throughput of wireless networks with broadcast nature. Existing network coding schemes (e.g., COPE) require information exchange among neighboring nodes, in order to correctly encode and decode the data packets. Such an approach results in significant overhead. Moreover, the information exchange can be delayed due to channel contention, and thus leads to inefficient coding (i.e., many missed coding opportunities). In this paper, we propose a new encoding strategy, XOR-Top, which relies on local topology information only, and uses bitwise XOR for packet coding. In addition, it proactively tries to decode coded packets stored in its buffer. Compared with COPE, XOR-Top can always accurately identify coding opportunities according to local topology, and consumes less bandwidth for signaling. Our simulation results have shown that Xor-Top improves the network throughput, by up to 240% over traditional unicast and up to 150% over COPE. Moreover, there is a significant reduction in average end-to-end packet latency.
Automatic real-time monitoring of locomotion and posture behaviour of pregnant cows prior to calving using online image analysis
Authors: Ö. Cangar, T. Leroy, M. Guarino, E. Vranken, R. Fallon, J. Lenehan, J. Mee, D. Berckmans
Venue: Computers and Electronics in Agriculture (2008)

Monitoring the locomotion and posture behaviour of pregnant cows close to calving is essential in determining if there is a need for human intervention to assist parturition. In this study an automatic real-time monitoring technique is described in detail which allows identifying the locomotion and posturing behaviour of pregnant cows prior to calving. For this purpose video surveillance images of eight cows for the last 24h prior to their calving were analysed. Data on seven different variables with time were obtained for each cow using an automatic real-time monitor. These were namely: x-y coordinates of the geometrical top view centre point of the cow; walking trajectory; distance walked; orientation of the main axis; body width/length ratio; hip length and back area. These variables were then used to classify specific behaviours such as standing or lying (including incidences of motion during lying), and eating or drinking. On average 85% of the standing and lying and 87% of the eating or drinking behaviour of the eight cows during the last 24h before calving could be correctly classified. However, the developed technique needs to be further validated with additional tests in the field.
Multipartite priority queues
Authors: Amr Elmasry, Claus Jensen, Jyrki Katajainen
Venue: ACM Transactions on Algorithms (TALG) (2008)

We introduce a framework for reducing the number of element comparisons performed in priority-queue operations. In particular, we give a priority queue which guarantees the worst-case cost of O(1) per minimum finding and insertion, and the worst-case cost of O(log n) with at most log n + O(1) element comparisons per deletion, improving the bound of 2 log n + O(1) known for binomial queues. Here, n denotes the number of elements stored in the data structure prior to the operation in question, and log n equals log2(max {2, n}). As an immediate application of the priority queue developed, we obtain a sorting algorithm that is optimally adaptive with respect to the inversion measure of disorder, and that sorts a sequence having n elements and I inversions with at most n log (I/n) + O(n) element comparisons.
Hierarchical SOMs: Segmentation of Cell-Migration Images
Authors: Chaoxin Zheng, Khurshid Ahmad, Aideen Long, Yuri Volkov, Anthony Davies, Dermot Kelleher
Venue: Proceedings of the 4th international symposium on Neural Networks: Part II--Advances in Neural Networks (2007)

The application of hierarchical self organizing maps (HSOM) to the segmentation of cell migration images, obtained during high-content screening in molecular medicine, is described. The segmentation is critical to our larger project for developing methods for the automatic annotation of cell migration images. The HSOM appears to perform better than the conventional computer-vision methods of histogram thresholding, edge detection, and the newer techniques involving single-layer SOMs. However, the HSOM techniques have to be complemented by region-based techniques to improve the quality of the segmented images.
Change Detection and Object Tracking in IR Surveillance Video
Authors: Mehmet Celenk, Don Venable, Mark Smearcheck, James Graham
Venue: Proceedings of the 2007 Third International IEEE Conference on Signal-Image Technologies and Internet-Based System (2007)

The appeal of change detection methods for surveillance systems arises from the need to monitor perturbations in the sensor’s field of view. Applications of change detection include satellite imagery, digital video compression algorithms, medical diagnosis, damage monitoring, and object tracking. The algorithm developed in this study is capable of extracting features from static background IR (infra-red) surveillance video by a spatio-temporal change detection frame work. Those features are then tracked by application of a similarity metric. The system is trained by observing the background for an extended period of time. The constructed background model helps the algorithm to detect non-stationary objects and extract their time-varying features such as motion and shape deformation. Spatial and spectral characteristics of these dynamic features enable the algorithm to identify targets of known nature and isolate them from the surrounding background cluttered by various objects and foreground.
Elicitation Strategies for Fuzzy Constraint Problems with Missing Preferences: Algorithms and Experimental Studies
Authors: Mirco Gelain, Maria Silvia Pini, Francesca Rossi, K. Brent Venable, Toby Walsh
Venue: Proceedings of the 14th international conference on Principles and Practice of Constraint Programming (2008)

Fuzzy constraints are a popular approach to handle preferences and over-constrained problems in scenarios where one needs to be cautious, such as in medical or space applications. We consider here fuzzy constraint problems where some of the preferences may be missing. This models, for example, settings where agents are distributed and have privacy issues, or where there is an ongoing preference elicitation process. In this setting, we study how to find a solution which is optimal irrespective of the missing preferences. In the process of finding such a solution, we may elicit preferences from the user if necessary. However, our goal is to ask the user as little as possible. We define a combined solving and preference elicitation scheme with a large number of different instantiations, each corresponding to a concrete algorithm which we compare experimentally. We compute both the number of elicited preferences and the "user effort", which may be larger, as it contains all the preference values the user has to compute to be able to respond to the elicitation requests. While the number of elicited preferences is important when the concern is to communicate as little information as possible, the user effort measures also the hidden work the user has to do to be able to communicate the elicited preferences. Our experimental results show that some of our algorithms are very good at finding a necessarily optimal solution while asking the user for only a very small fraction of the missing preferences. The user effort is also very small for the best algorithms. Finally, we test these algorithms on hard constraint problems with possibly missing constraints, where the aim is to find feasible solutions irrespective of the missing constraints.
Advanced Data Structures, 1 edition
Authors: Peter Brass
Venue:  (2008)

Advanced Data Structures presents a comprehensive look at the ideas, analysis, and implementation details of data structures as a specialized topic in applied algorithms. Data structures are how data is stored within a computer, and how one can go about searching for data within. This text examines efficient ways to search and update sets of numbers, intervals, or strings by various data structures, such as search trees, structures for sets of intervals or piece-wise constant functions, orthogonal range search structures, heaps, union-find structures, dynamization and persistence of structures, structures for strings, and hash tables. This is the first volume to show data structures as a crucial algorithmic topic, rather than relegating them as trivial material used to illustrate object-oriented programming methodology, filling a void in the ever-increasing computer science market. Numerous code examples in C and more than 500 references make Advanced Data Structures an indispensable text. topic. Numerous code examples in C and more than 500 references make Advanced Data Structures an indispensable text.
A Peer-to-Peer Normative System to Achieve Social Order
Authors: Amandine Grizard, Laurent Vercouter, Tiberiu Stratulat, Guillaume Muller
Venue: Coordination, Organizations, Institutions, and Norms in Agent Systems II: AAMAS 2006 and ECAI 2006 International Workshops, COIN 2006 Hakodate, Japan, May 9, 2006 Riva del Garda, Italy, August 28, 2006. Revised Selected Papers (2007)

Social order in distributed descentralised systems is claimed to be obtained by using social norms and social control. This paper presents a normative P2P architecture to obtain social order in multi-agent systems. We propose the use of two types of norms that coexist: rules and conventions. Rules describe the global normative constraints on autonomous agents, whilst conventions are local norms. Social control is obtained by providing a non-intrusive control infrastructure that helps the agents build reputation values based on their respect of norms. Some experiments are presented that show how communities are dynamically formed and how bad agents are socially excluded.
eKnowledge Repositories in eLearning 2.0: UNITE - a European-Wide Network of Schools
Authors: Christoph Hornung, Andrina Granić, Maja Ćukušić, Kawa Nazemi
Venue: Proceedings of the 7th international conference on Advances in Web Based Learning (2008)

The upcoming Web 2.0 technologies change the aspects of eLearning fundamentally. The traditional paradigm of classroom teaching and homework learning will develop further towards sharing experiences and knowledge in word-wide social communities. Moreover, knowledge capturing in ambient environments gains more and more importance. These aspects characterize the so-called eLearning 2.0. This paper describes a prototype of an eLearning 2.0 system covering the different aspects such as platform, pedagogy and scenarios. The concepts presented here have been applied in the EU-project UNITE. The implementation of this system in the setting of a European network of fourteen schools is presented as an iterative four stage process, covering scenario planning and implementation, validation in addition to platform and process improvement. Achieved intermediate results from the first iteration of the implementation process are discussed and future work is presented.
Efficient Implementation of Tree Accumulations on Distributed-Memory Parallel Computers
Authors: Kiminori Matsuzaki
Venue: Proceedings of the 7th international conference on Computational Science, Part II (2007)

In this paper, we develop an efficient implementation of two tree accumulations. In this implementation, we divide a binary tree based on the idea of m-bridges to obtain high locality, and represent local segments as serialized arrays to obtain high sequential performance. We furthermore develop a cost model for our implementation. The experiment results show good performance.
The Bedwyr System for Model Checking over Syntactic Expressions
Authors: David Baelde, Andrew Gacek, Dale Miller, Gopalan Nadathur, Alwen Tiu
Venue: Proceedings of the 21st international conference on Automated Deduction: Automated Deduction (2007)

Bedwyr is a generalization of logic programming that allows model checking directly on syntactic expressions possibly containing bindings. This system, written in OCaml, is a direct implementation of two recent advances in the theory of proof search. The first is centered on the fact that both finite success and finite failure can be captured in the sequent calculus by incorporating inference rules for definitions that allow fixed points to be explored. As a result, proof search in such a sequent calculus can capture simple model checking problems as well as may and must behavior in operational semantics. The second is that higher-order abstract syntax is directly supported using term-level ¿-binders and the ¿ quantifier. These features allow reasoning directly on expressions containing bound variables.
Reverse engineering of design patterns from java source code
Authors: Ronald A. Olsson
Venue:  (2007)

Recovering design patterns can enhance existing source code analysis tools by bringing program understanding to the design level. This dissertation presents a new, fully automated pattern detection approach based on our reclassification of the GoF patterns by their pattern intent. We argue that the GoF pattern catalog classifies design patterns in the forward-engineering sense; our reclassification is better suited for reverse engineering. Our approach uses lightweight static program analysis techniques to capture program intent. This dissertation also describes our tool, PINOT, that implements this new approach. PINOT detects all the GoF patterns that have concrete definitions driven by code structure or system behavior. PINOT is faster, more accurate, and targets more patterns than existing pattern detection tools. PINOT has been tested against several benchmark applications, including Apache Ant, Java AWT, JHotDraw, and Swing. Since PINOT has proven successful, we extend PINOT to recognize a broader range of design patterns. This dissertation describes our pattern detection language, MUSCAT, that allows users to define and analyze their own design patterns using the PINOT engine. MUSCAT is a visual language that allows users to model program intent by specifying both the structural- and behavioral-aspects of a design pattern. This dissertation evaluates MUSCAT and discusses the trade-offs between effectiveness and flexibility.
Effects of management innovation on industry development: the example of telecommunication industry in China
Authors: Wu Weiwei, Chen Qiang, He Hui
Venue: Proceedings of the 10th WSEAS International Conference on Mathematical Methods and Computational Techniques in Electrical Engineering (2008)

Management innovation is one of the important factors to promote the industry development except capital, labor and technology advancement. But a little attention is paid to the effects of management innovation on industry development, which results in two questions: what's the contribution of management innovation on industry development? And how does management innovation affect industry development? This paper addresses the two main research questions by taking China's telecommunication industry as an example. The production function model of Tin Bergen is improved to measure the contribution of management innovation, and the mode of management innovation affecting industrial development is also explained. The results show that management innovation exerts great influences on telecommunication industry with its contribution degree increasing gradually, and management innovation is the core element relating labor, capital and technology in industry development.
Bearing-Only Target Tracking Based on Big Bang - Big Crunch Algorithm
Authors: H. M. Genç, A. K. Hocaoglu
Venue: Proceedings of the 2008 The Third International Multi-Conference on Computing in the Global Information Technology (iccgi 2008) (2008)

Target tracking based on passive sensor data is of great importance in practical applications. In bearing only target tracking, the basic parameters defining the target motion is estimated through noise corrupted measurement data. Depending on the noise characteristics, the search space has many local minima. Obtaining the global minimum –that is the optimal solution – is an active area of research over the past few decades. In this work, a new optimization algorithm, namely Big Bang – Big Crunch algorithm is shown to fit this problem. The results are superior relative to classical genetic algorithm approach both in terms of speed and accuracy.
Accomplishments and Challenges in Bioinformatics
Authors: See-Kiong Ng, Limsoon Wong
Venue: IT Professional (2004)

Research in the "postgenome era" examines the genomic data produced by DNA sequencing efforts, seeking a greater understanding of biological life.
Speeding up syntax: On the relative timing and automaticity of local phrase structure and morphosyntactic processing as reflected in event-related brain potentials
Authors: Anna S. Hasting, Sonja A. Kotz
Venue: Journal of Cognitive Neuroscience (2008)

Neurolinguistic research utilizing event-related brain potentials (ERPs) typically relates syntactic phrase structure processing to an early automatic processing stage around 150 to 200 msec, whereas morphosyntactic processing is associated with a later and somewhat more attention-dependent processing stage between 300 and 500 msec. However, recent studies have challenged this position by reporting highly automatic ERP effects for morphosyntax in the 100 to 200 msec time range. The present study aimed at determining the factors that could contribute to such shifts in latency and automaticity. In two experiments varying the degree of attention, German phrase structure and morphosyntactic violations were compared in conditions in which the locality of the violated syntactic relation, as well as the violation point and the acoustic properties of the speech stimuli, were strictly controlled for. A negativity between 100 and 300 msec after the violation point occurred in response to both types of syntactic violations and independently of the allocation of attentional resources. These findings suggest that the timing and automaticity of ERP effects reflecting specific syntactic subprocesses are influenced to a larger degree by methodological than by linguistic factors, and thus, need to be regarded as relative rather than fixed to temporally successive processing stages.
Adaptive terrain triangulation using the representation of quad trees by vertex textures and wavelet estimation of vertex significance
Authors: E. A. Yusov, V. E. Turlapov
Venue: Programming and Computing Software (2008)

A method of adaptive terrain triangulation is proposed that can be implemented in hardware. The method is based on an estimate of the static error of a quad tree nodes using wavelet transforms and on the representation of the resulting quad tree by a vertex texture. The proposed method has the following characteristic features: the adjacent nodes of the generated adapted mesh can differ in any number of hierarchical levels; the triangulation process is not limited by the size of the decomposition segments, which solves the problem of joining segments without inserting additional nodes; the multiscale terrain representation used in the method makes it possible to store the levels of detail in the graphics processor memory as a multilevel vertex texture; thus, the costliest part of the algorithm can be efficiently implemented using a vertex shader.When constructing the triangulation, the algorithm takes into account both local features of the terrain and the camera location; also, it has a natural support of geomorphing.
Monotone Mamdani--Assilian models under mean of maxima defuzzification
Authors: Ester Van Broekhoven, Bernard De Baets
Venue: Fuzzy Sets and Systems (2008)

In the Mamdani-Assilian models considered in this study, the linguistic values of the input variables as well as the output variable are described by trapezoidal membership functions forming a fuzzy partition, the rule base is monotone and the crisp output is obtained by the Mean of Maxima (MOM) defuzzification method. It is verified for each of the three basic t-norms T"M, T"P and T"L whether a monotone input-output behaviour is obtained for any monotone rule base, or at least for any monotone smooth rule base. For models applying T"L a monotone input-output behaviour can only be guaranteed if the model has a single input variable. The monotonicity of models with two or more input variables applying T"M cannot be guaranteed for any monotone rule base, whereas when applying T"P monotonicity is only guaranteed for any monotone rule base when using a fuzzy output partition belonging to a restricted class of nine types of fuzzy partitions which contain at most five linguistic values. Finally, it is proved that a monotone input-output behaviour is always obtained for models with a monotone smooth rule base applying T"M when the linguistic output values in the consequents of the rules are defined by trapezoidal or triangular membership functions with intervals of changing membership degree of equal length-a restriction that can easily be bypassed by an auxiliary interpolation procedure-and for models with a monotone smooth rule base applying T"P for any fuzzy output partition.
Volume visualization and exploration through flexible transfer function design
Authors: Francisco de M. Pinto, Carla M. D. S. Freitas
Venue: Computers and Graphics (2008)

Direct volume rendering (DVR) is a well-known method for exploring volumetric data sets. Optical properties are assigned to the volume data and then a DVR algorithm produces visualizations by sampling volume elements and projecting them into the image plane. The mapping from voxel values to optical attribute values is known as transfer function (TF). Therefore, the quality of a visualization is highly dependent on the TF employed, but its specification is a non-trivial and unintuitive task. Without any help during the TF design process, the user goes through a frustrating and time-consuming trial-and-error cycle. This paper presents a useful combination of TF design techniques in an interactive workspace for volume visualization. Our strategy relies on semi-automatic TFs generation methods: boundary emphasis, stochastic evolutive search in TF space, and manual TF specification aided by dual domain interaction. A two-level user interface was also developed. In the first level, it provides multiple simultaneous interactive visualizations of the volume data using different TFs, while in the second one, a detailed visualization of a single TF and the respective rendered volume are displayed. Moreover, in the second level, the TF can be manually refined and the volume can be further inspected through geometric tools. The techniques combined in this work are complementary, allowing easy and fast TF design and data exploration.