ppxscal/embedding_network huggingface dataset:
Incidence of the improvement of the transport: MAC protocols interactions on MANET performance
Authors: Sofiane Hamrioui, Mustapha Lalam
Venue: Proceedings of the 8th international conference on New technologies in distributed systems (2008)

A MANET (Mobile Ad hoc Network) is a collection of terminals equipped with one or several wireless network interfaces. These terminals are potentially mobile and heterogeneous. During their exchanges, every layer of the protocols stack intervenes with its functionality while ignoring its impact on those of other layers. In MANET, functionalities of the MAC (Medium Access Control) layer and the transport layer are very important. In this paper, we study the interactions between MAC protocol and transport protocols notably TCP (Transfer Control Protocol) protocol. We suggest an improvement of these interactions for a better QoS (Quality of service) in MANET. This improvement is based on two solutions. The first one consists on using MAC protocol with a new Backoff algorithm based on a dynamic adaptation of its maximal and minimal bounds in function of the number of nodes used in the network. As for the second solution, it proposes a new TCP acknowledgement mechanism in order to delay these acknowledgements according to the number of nodes. Finally, we end our paper by showing the incidence of this improvement on MANET performance.
Distributed Evasive Scan Techniques and Countermeasures
Authors: Min Gyung Kang, Juan Caballero, Dawn Song
Venue: Proceedings of the 4th international conference on Detection of Intrusions and Malware, and Vulnerability Assessment (2007)

Scan detection and suppression methods are an important means for preventing the disclosure of network information to attackers. However, despite the importance of limiting the information obtained by the attacker, and the wide availability of such scan detection methods, there has been very little research on evasive scan techniques, which can potentially be used by attackers to avoid detection. In this paper, we first present a novel classification of scan detection methods based on their amnesty policy, since attackers can take advantage of such policies to evade detection. Then we propose two novel metrics to measure the resources that an attacker needs to complete a scan without being detected. Next, we introduce z-Scan, a novel evasive scan technique that uses distributed scanning, and show that it is extremely effective against TRW, one of the state-of-the-art scan detection methods. Finally, we investigate possible countermeasures including hybrid scan detection methods and information-hiding techniques. We provide theoretical analysis, as well as simulation results, to quantitatively measure the effectiveness of the evasive scan techniques and the countermeasures.
Computer vision-based clear path guidance for blind wheelchair users
Authors: Volodymyr Ivanchenko, James Coughlan, William Gerrey, Huiying Shen
Venue: Proceedings of the 10th international ACM SIGACCESS conference on Computers and accessibility (2008)

We describe a system for guiding blind and visually impaired wheelchair users along a clear path that uses computer vision to sense the presence of obstacles or other terrain features and warn the user accordingly. Since multiple terrain features can be distributed anywhere on the ground, and their locations relative to a moving wheelchair are continually changing, it is challenging to communicate this wealth of spatial information in a way that is rapidly comprehensible to the user. The main contribution of our system is the development of a novel user interface that allows the user to interrogate the environment by sweeping a standard (unmodified) white cane back and forth: the system continuously tracks the cane location and sounds an alert if a terrain feature is detected in the direction the cane is pointing. Experiments are described demonstrating the feasibility of the approach.
Information scraps: How and why information eludes our personal information management tools
Authors: Michael Bernstein, Max Van Kleek, David Karger, M. C. Schraefel
Venue: ACM Transactions on Information Systems (TOIS) (2008)

In this article we investigate information scraps&mdash;personal information where content has been scribbled on Post-it notes, scrawled on the corners of sheets of paper, stuck in our pockets, sent in email messages to ourselves, and stashed in miscellaneous digital text files. Information scraps encode information ranging from ideas and sketches to notes, reminders, shipment tracking numbers, driving directions, and even poetry. Although information scraps are ubiquitous, we have much still to learn about these loose forms of information practice. Why do we keep information scraps outside of our traditional PIM applications&quest; What role do information scraps play in our overall information practice&quest; How might PIM applications be better designed to accommodate and support information scraps' creation, manipulation and retrieval&quest; We pursued these questions by studying the information scrap practices of 27 knowledge workers at five organizations. Our observations shed light on information scraps' content, form, media, and location. From this data, we elaborate on the typical information scrap lifecycle, and identify common roles that information scraps play: temporary storage, archiving, work-in-progress, reminding, and management of unusual data. These roles suggest a set of unmet design needs in current PIM tools: lightweight entry, unconstrained content, flexible use and adaptability, visibility, and mobility.
Numerical algorithms for analysis of distributed parameter systems in engineering
Authors: Ion Cârstea, Daniela Cârstea, Alexandru Adrian Cârstea
Venue: Proceedings of the 9th WSEAS International Conference on International Conference on Automation and Information (2008)

In this work we survey our research on domain decomposition and related algorithms for elliptic and/or parabolic systems. Our emphasis is on numerical algorithms for simulation of distributed-parameter systems described by elliptic and/or parabolic equations. We present a large class of systems with emphasis on coupled problems in engineering. The algorithms are developed in the context of the finite element method.
On the Number of Two-Weight Cyclic Codes with Composite Parity-Check Polynomials
Authors: Gerardo Vega
Venue: Proceedings of the 2nd international workshop on Arithmetic of Finite Fields (2008)

Sufficient conditions for the construction of a two-weight cyclic code by means of the direct sum of two one-weight cyclic codes, were recently presented in [4]. On the other hand, an explicit formula for the number of one-weight cyclic codes, when the length and dimension are given, was proved in [3]. By imposing some conditions on the finite field, we now combine both results in order to give a lower bound for the number of two-weight cyclic codes with composite parity-check polynomials.
Generation and visualization of emotional states in virtual characters
Authors: Diana Arellano
Venue: Computer Animation and Virtual Worlds (2008)

This paper presents an affective model that determines the emotional state of a character according to the personality traits and the experienced emotions. We consider an emotional state as the layer between personality and emotion. The proposed affective model offers a mapping between emotions and emotional states. To evidence emotional states of a virtual character, we can attribute them facial expressions based on their associated emotions. Facial expressions for intermediate emotions are generated automatically from expressions for universal emotions. The experiments show coherent emotional states produced by a simulated story. They also present how the corresponding emotions were represented through dynamic and static facial expressions. Finally, the obtained results demonstrate the satisfactory recognition by a group of people unfamiliar with the work described. Copyright &copy; 2008 John Wiley & Sons, Ltd.
Knowledge Structure on Virus for User Education
Authors: Madihah Saudi, Nazean Jomhari
Venue: Computational Intelligence and Security: International Conference, CIS 2006, Guangzhou, China, November 3-6, 2006, Revised Selected Papers (2007)

There are many factors contribute to the virus spread and infection. One of the big challenges in confronting computer viruses is to educate user. It needs a lot of effort to educate user about computer virus. The researchers have produced ECOVP which is to help user handle virus problem and the targets users including home user, non-IT literature background and IT personnel needs in handling virus incident. Researchers had studied what are the information needs to be process, so we could use them to generate the knowledge on how to handle the virus problem. We had identified seven important criteria for user need to understand in capable for them facing the computer virus. However, this paper is focusing on virus attack on Windows platform only.
Time-Complexity Semantics for Feasible Affine Recursions
Authors: Norman Danner, James S. Royer
Venue: Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World (2007)

The authors' ATR programming formalism is a version of call-by-value PCF under a complexity-theoretically motivated type system. ATR programs run in type-2 polynomial-time and all standard type-2 basic feasible functionals are ATR-definable (ATR types are confined to levels 0, 1, and 2). A limitation of the original version of ATR is that the only directly expressible recursions are tail-recursions. Here we extend ATR so that a broad range of affine recursions are directly expressible. In particular, the revised ATR can fairly naturally express the classic insertion- and selection-sort algorithms, thus overcoming a sticking point of most prior implicit-complexity-based formalisms. The paper's main work is in extending and simplifying the original time-complexity semantics for ATR to develop a set of tools for extracting and solving the higher-type recurrences arising from feasible affine recursions.
Multiple Sources Data Fusion Strategies Based on Multi-class Support Vector Machine
Authors: Luo Zhong, Zhe Li, Zichun Ding, Cuicui Guo, Huazhu Song
Venue: Proceedings of the 5th international symposium on Neural Networks: Advances in Neural Networks (2008)

Data fusion from multiple sources is very important and useful. Some strategies for multiple sources data fusion based on Multi-class Support Vector Machine (MSVM) are proposed in this paper. The features (independent components) of data from multiple sources are extracted for fusion. The Dempster-Shafer theory (DS theory) and Bayesian theory are used to combine the probabilistic outputs of MSVMs. Then the outputs of DS theory combination are classified by a MSVM to get the final decision of the classification. Finally, these strategies are evaluated by three data sets and the results show that DS theory can improve the accuracy obviously, and the strategies based on MSVM and DS theory is very fit for solving problems with small data sets.
A New Approach for Image Restoration Based on CNN Processor
Authors: Jianye Zhao, Quansheng Ren, Jian Wang, Hongling Meng
Venue: Proceedings of the 4th international symposium on Neural Networks: Advances in Neural Networks, Part III (2007)

A new approach for maximum posterior probability (MAP) image restoration based on cellular neural network (CNN) is proposed in this paper, and hardware realization is also discussed. According to analysis of MAP image restoration, a new template is proposed for CNN image restoration. The computer simulation result proves the approach is reasonable, then a hardware system based on CNN processor is setup for the restoration algorithm, and the effectiveness of the CNN processor is also confirmed in this system.
Evaluation of the robustness of the polynomial segment models to noisy environments with unsupervised adaptation
Authors: Jeff Siu-Kei Au-Yeung, Manhung Siu
Venue: Speech Communication (2008)

Recently, the polynomial segment models (PSMs) have been shown to be a competitive alternative to the HMM in large vocabulary continuous recognition task [Li, C., Siu, M., Au-yeung, S., 2006. Recursive likelihood evaluation and fast search algorithm for polynomial segment model with application to speech recognition. IEEE Trans. on Audio, Speech and Language Processing 14, 1704-1708]. Its more constrained nature raises the issue of robustness under environmental mis-matches. In this paper, we examine the robustness properties of PSMs using the Aurora 4 corpus under both clean training and multi-conditional training. In addition, we generalize two unsupervised model adaptation schemes, namely, the maximum likelihood linear regression (MLLR) and reference speaker weighting (RSW), to be applicable for PSMs and explore their effectiveness in PSM environmental adaptation. Our experiments showed that although the word error rate differences between PSMs and HMMs became smaller under noisy test environments than under clean test environment, PSMs were still competitive under mis-match conditions. After model adaptation, especially with the RSW adaptation, the word error rates were reduced for both HMMs and PSMs. The best word error rate was obtained with RSW-adapted PSMs by rescoring lattices generated with the adapted HMMs. Overall, with model adaptation, the recognition word error rate can be reduced by more than 20%.
Matching Hierarchies Using Shared Objects
Authors: Robert Ikeda, Kai Zhao, Hector Garcia-Molina
Venue: Proceedings of the 12th European conference on Research and Advanced Technology for Digital Libraries (2008)

One of the main challenges in integrating two hierarchies (e.g., of books or web pages) is determining the correspondence between the edges of each hierarchy. Traditionally, this process, which we call hierarchy matching, is done by comparing the text associated with each edge. In this paper we instead use the placement of objects present in both hierarchies to infer how the hierarchies relate. We present two algorithms that, given a hierarchy with known facets (attribute-value pairs that define what objects are placed under an edge), determine feasible facets for a second hierarchy, based on shared objects. One algorithm is rule-based and the other is statistics-based. In the experimental section, we compare the results of the two algorithms, and see how their performances vary based on the amount of noise in the hierarchies.
On Retrieval of Flash Animations Based on Visual Features
Authors: Xiangzeng Meng, Lei Liu
Venue: Proceedings of the 3rd international conference on Technologies for E-Learning and Digital Entertainment (2008)

Flash is undergoing an explosive spread as a new prevailing media format on the Web. Unfortunately, few research efforts have been devoted to content-based Flash retrieval (CBFR) in IR community, which goes against the utilization of the enormous Flash resources. In this paper, Flash animation in 3-layer architecture is presented after it is segmented based on its visual features to a series of scenes on time-line of the production process. A promising approach of Flash animation retrieval is proposed based on the visual features of scenes and some meta-parameters. An experimental prototype system of Flash animation retrieval with roughly 100,000 Flash animations in total is built. The primary experiment demonstrates the flexibility and the effectiveness of our approach of CBFR.
The Extreme Programming Bandwagon: Revolution or Just Revolting?
Authors: Colin J. Neill
Venue: IT Professional (2003)

Before joining the throngs of agile-development supporters, it's wise to examine this new movement.
Safety of Recreational Water Slides: Numerical Estimation of the Trajectory, Velocities and Accelerations of Motion of the Users
Authors: Piotr Szczepaniak, Ryszard Walentyński
Venue: Proceedings of the 7th international conference on Computational Science, Part II (2007)

The article briefly shows how to estimate the safety of recreational water slides by numerical analysis of motion of the users. There are presented: mathematical description of a typical water slides geometry, simplified model of a sliding person, model of contact between the user and the inner surface of the slide, equations of motion written for a rigid body with 6 degrees of freedom and finally some sample results compared to the limitations set by current European Standard.
A Real-Time Adaptive Wavelet Transform-Based QRS Complex Detector
Authors: Marek Rudnicki, Paweł Strumiłło
Venue: Proceedings of the 8th international conference on Adaptive and Natural Computing Algorithms, Part II (2007)

In this paper, the design and test results of a QRS complex detector are presented. The detection algorithm is based on the Discrete Wavelet Transform and implements an adaptive weighting scheme of the selected transform coefficients in the time domain. It was tested against a standard MIT-BIH Arrhythmia Database of ECG signals for which sensitivity (Se) of 99.54% and positive predictivity (+ P) of 99.52% was achieved. The designed QRS complex detector is implemented on TI TMS320C6713 DSP for real-time processing of ECGs.
Maximizing the Fault Tolerance Capability of Fixed Priority Schedules
Authors: Radu Dobrin, Hüseyin Aysan, Sasikumar Punnekkat
Venue: Proceedings of the 2008 14th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (2008)

Real-time systems typically have to satisfy complex requirements, mapped to the task attributes, eventually guaranteed by the underlying scheduler. These systems consist of a mix of hard and soft tasks with varying criticality, as well as associated fault tolerance requirements. Additionally, the relative criticality of tasks could undergo changes during the system evolution. Time redundancy techniques are often preferred in embedded applications and, hence, it is extremely important to devise appropriate methodologies for scheduling real-time tasks under failure assumptions.In this paper, we propose a methodology to provide a priori guarantees in fixed priority scheduling (FPS) such that the system will be able to tolerate one error per every critical task instance. We do so by using Integer Linear Programming (ILP) to derive task attributes that guarantee re-execution of every critical task instance before its deadline, while keeping the associated costs minimized. We illustrate the effectiveness of our approach, in comparison with fault tolerant (FT) adaptations of the well-known rate monotonic (RM) scheduling, by simulations.
Model Checking Abstract Components within Concrete Software Environments
Authors: Tonglaga Bao, Mike Jones
Venue: Proceedings of the 15th international workshop on Model Checking Software (2008)

In order to model check a software component which is not a standalone program, we need a model of the software which completes the program. This is typically done by abstracting the surrounding software and the environment in which the entire system will be executed. However, abstracting the surrounding software artifact is difficult when the surrounding software is a large, complex artifact. In this paper, we take a new approach to the problem by abstracting the software component under test and leaving the surrounding software concrete. We compare three abstraction schemes, bitstate hashing and two schemes based on predicate abstraction, which can be used to abstract the components. We show how to generate the mixed abstract-concrete model automatically from a C program and verify the model using the SPIN model checker. We give verification results for three C programs each consisting of hundreds or thousands of lines of code, pointers, data structures and calls to library functions. Compared to the predicate abstraction schemes, bitstate hashing was uniformly more efficient in both error discovery and exhaustive state enumeration. The component abstraction results in faster error discovery than normal code execution when pruning during state enumeration avoids repeated execution of instructions on the same data.
Enhanced Services for Targeted Information Retrieval by Event Extraction and Data Mining
Authors: Felix Jungermann, Katharina Morik
Venue: Proceedings of the 13th international conference on Natural Language and Information Systems: Applications of Natural Language to Information Systems (2008)

We present a framework combining information retrieval with machine learning and (pre-)processing for named entity recognition in order to extract events from a large document collection. The extracted events become input to a data mining component which delivers the final output to specific user's questions. Our case study is the public collection of minutes of plenary sessions of the German parliament and of petitions to the German parliament.
LBP Texture Analysis Based on the Local Adaptive Niblack Algorithm
Authors: Yu Wang, Xueye Wei, Shuo Xiao
Venue: Proceedings of the 2008 Congress on Image and Signal Processing, Vol. 2 - Volume 02 (2008)

Local Binary Pattern (LBP) proposed by Ojala T is a typical texture analysis algorithm. It is widely used in the texture classification domain and etc. In this paper, we consider the local pixels’ effects among them efficiently when the LBP algorithm is used. In our proposed LBP algorithm, the central pixel in the local region was added into the procedure to calculate the local threshold using the Niblack algorithm. The histogram equalization is always used to actualize the illumination invariability in LBP algorithm. But the histogram equalization can not avoid the variety of local grayscale caused by the illumination. In order to avoid this weakness, a kind of illumination factor is brought into the Niblack algorithm. The values of the illumination factor can be got adaptively with the changes of illumination. By using the improved Niblack algorithm, the local threshold can be calculated adaptively. The proposed LBP algorithm in this paper can get more texture information and it has illumination adaptability.
A study of communities and influence in blogosphere
Authors: Nitin Agarwal
Venue: Proceedings of the 2nd SIGMOD PhD workshop on Innovative database research (2008)

Blogging becomes a popular way for a Web user to publish information on the Web. Bloggers write blog posts, share likes and dislikes, voice opinions, provide suggestions, and report news. In this work we study influential bloggers in both community as well as individual blogs. We synthesize virtual communities by aggregating individual blogs with similar interests. We formulate the problem for identifying influential bloggers and synthesizing virtual communities from individual blogs, present a preliminary model, discuss the challenges, and pave the way for building a robust model that allows finding various types of the influentials. To illustrate these issues, we conduct experiments with data from a real-world blog site, evaluate multi-facets of the problem, and discuss unique challenges. We conclude with interesting findings and future work.
Stereoscopic Digital Mammography: Improved Accuracy of Lesion Detection in Breast Cancer Screening
Authors: David J. Getty, Carl J. D'Orsi, Ronald M. Pickett
Venue: Proceedings of the 9th international workshop on Digital Mammography (2008)

We report on a clinical trial comparing stereoscopic full-field digital mammography to standard (non-stereo) full-field digital mammography for detection of true breast lesions in a screening population. Each of 1458 enrolled patients received both a standard screening examination and a stereoscopic screening examination, which were read independently by different radiologists. Compared to standard digital mammography, stereo mammography significantly reduced false positive lesion detections by 46% (p< 0.0001), and significantly increased true positive lesion detections by 23% (p< 0.05).