ppxscal/embedding_network huggingface dataset:
Multilevel Pattern Matching Architecture for Network Intrusion Detection and Prevention System
Authors: Tian Song, Zhizhong Tang, Dongsheng Wang
Venue: Proceedings of the 3rd international conference on Embedded Software and Systems (2007)

Pattern matching is one of the most performance critical components in network intrusion detection and prevention system, which needs to be accelerated by carefully designed architectures. In this paper, we present a highly parameterized multilevel pattern matching architecture (MPM), which is implemented on FPGA by exploiting redundant resources among patterns for less chip area. In practice, MPM can be partitioned to several pipelines for high frequency. This paper also presents a pattern set compiler that can generate RTL codes of MPM with the given pattern set and predefined parameters. One MPM architecture is generated by our compiler based on Snort rules on Xilinx FPGA. The results show that MPM can achieve 4.3Gbps throughput with only 0.22 slices per character, about one half chip area than the most area-efficient architecture in literature. MPM can be parameterized potential for more than 100 Gbps throughput.
Multi-parameter Differential Pressure Flowmeter Nonlinear Calibration Based on SVM
Authors: Jingqi Fu, Jing Li, Ling Wang
Venue: Proceedings of the 4th international conference on Intelligent Computing: Advanced Intelligent Computing Theories and Applications - with Aspects of Theoretical and Methodological Issues (2008)

In this paper, a novel modeling method of difference pressure mass flow measurement nonlinear correction based on Support Vector Machine is introduced. Support Vector Machine is a novel machine learning method, which identify the correction model definitely just according to the samples. Flow measurement nonlinear correction is a small sample problem. The result of the simulation for orifice flowmeter error correction based on SVM shows that this method can get a better effect.
Route Optimization Using Q-Learning for On-Demand Bus Systems
Authors: Naoto Mukai, Toyohide Watanabe, Jun Feng
Venue: Proceedings of the 12th international conference on Knowledge-Based Intelligent Information and Engineering Systems, Part II (2008)

In this paper, we focus on a new transport service called on-demand bus system. A major feature of the system is that buses pick up customers door-to-door when needed or required. Thus, there is no pre-determined travel routes for buses, and travel routes must be changed according to the occurrence frequency of customers. In order to find a more effective travel plan to the problem, we adopt Q-learning which is one of the machine learning algorithms. However, native Q-learning is inadequate to our target problem because the number of customers at pick-up points is time-dependent. Therefore, we improve an update process of Q values and a selection process of the next pick-up point, on the basis of time passage parameters. In particular, rewards are understated in update process, on the other hand, Q values are overstated in selection process. At the last, we report our simulation results and show the effectiveness of our algorithm for the problem.
Using Centrality to Rank Web Snippets
Authors: Valentin Jijkoun, Maarten Rijke
Venue: Advances in Multilingual and Multimodal Information Retrieval: 8th Workshop of the Cross-Language Evaluation Forum, CLEF 2007, Budapest, Hungary, September 19-21, 2007, Revised Selected Papers (2008)

We describe our participation in the WebCLEF 2007 task, targeted at snippet retrieval from web data. Our system ranks snippets based on a simple similarity-based centrality, inspired by the web page ranking algorithms. We experimented with retrieval units (sentences and paragraphs) and with the similarity functions used for centrality computations (word overlap and cosine similarity). We found that using paragraphs with the cosine similarity function shows the best performance with precision around 20% and recall around 25% according to human assessments of the first 7,000 bytes of responses for individual topics.
A Commitment-Based Communicative Act Library
Authors: Mario Verdicchio, Marco Colombetti
Venue: Agent Communication II: International Workshops on Agent Communication, AC 2005 and AC 2006, Utrecht, Netherlands, July 25, 2005, and Hakodate, Japan, May 9, 2006, Selected and Revised Papers (2006)

The Agent Communication Language (ACL) proposed by the Foundation for Intelligent Physical Agents (FIPA) is the most complete attempt to create a universally accepted standard so far. Nevertheless, this standard shows some shortcomings which are probably hindering an even greater impact upon the scientific research dealing with multiagent systems. Although agreeing with the mainstream view that analyzes agent communication in terms of communicative acts, we part from FIPA's assumptions about the semantics, as we shift the focus from affecting communicating agents' mental states to modifying the commitments binding them to each other. We show that our commitment-based framework is powerful enough to allow for the main FIPA communicative acts and provides a semantics which overcomes some of the problems that are currently affecting the standard.
Tracy: a debugger and system analyzer for cross-platform graphics development
Authors: Sami Kyöstilä, Kari J. Kangas, Kari Pulli
Venue: Proceedings of the 23rd ACM SIGGRAPH/EUROGRAPHICS symposium on Graphics hardware (2008)

We describe Tracy, an offline graphics debugging and system analysis toolkit for cross-platform system and application development in mobile graphics. Tracy operates by recording graphics function calls and argument data of unmodified applications into a trace file for offline playback, debugging, and performance analysis. In addition, traces can be edited and converted into platform-independent C files. We pay special attention to real-time performance; our trace compression mechanism allows interactive use of applications even when tracing long, multi-thousand-frame traces in real mobile hardware. We describe the use of the toolkit through real-world use cases such as debugging a visual error or a performance problem in an application, analyzing the application quality, and benchmarking a graphics engine.
Requirements Engineering in Automotive Development: Experiences and Challenges
Authors: Matthias Weber, Joachim Weisbrod
Venue: IEEE Software (2003)

Using real-world projects as a foundation, the authors describe requirements engineering challenges and the solutions they've found while developing software-based automotive systems at DaimlerChrysler. They discuss both domain-specific challenges related to requirements content in particular application areas and domain-independent issues related to requirements administration and management. Although the issues they raise are not necessarily the focus of current requirements engineering research, they argue that they're of crucial importance for improving requirements engineering in developing software for automotive and other complex systems.
Image Classification by Histogram Features Created with Learning Vector Quantization
Authors: Marcin Blachnik, Jorma Laaksonen
Venue: Proceedings of the 18th international conference on Artificial Neural Networks, Part I (2008)

Histogram-based data analysis is one of the most popular solutions for many problems related to image processing such as object recognition and classification. In general a histogram preserves more information from the first-order statistics of the original data than simple averaging of the raw data values. In the simplest case, a histogram model can be specified for a specific image feature type independently of any real image content. In the opposite extreme, the histograms can be made dependent not only the actual image contents, but also on the known semantic classes of the images. In this paper, we propose to use the Learning Vector Quantization (LVQ) algorithm in fine-tuning the codebook vectors for more efficient histogram creation. The performed experiments show that the accuracy of the Interest Point Local Descriptors (IPLD) feature for image classification can be improved by the proposed technique.
Estimation of a Ratio in the Finite Population
Authors: Danutė Krapavickaitė, Aleksandras Plikusas
Venue: Informatica (2005)

Estimation of the ratio of two totals is considered, when a probability sample from the finite population is available. Four estimators of the ratio are examined. The first one - called &ldquo;simple&rdquo; - is the ratio of the Horvitz-Thompson estimators of totals; the second - the ratio of two ratio estimators of totals; the third one - the ratio of two regression estimators of totals. The fourth one is a calibrated estimator of the ratio. The variances of these estimators are compared. The properties of such estimators of the ratio are studied. The simulation results are presented.
A Semantic Framework for Modeling and Reasoning about Reflective Middleware
Authors: Nalini Venkatasubramanian, Carolyn L. Talcott
Venue: IEEE Distributed Systems Online (2001)

Open distributed systems evolve dynamically, and their components interact with environments that are not under their control. A reflective model of distributed computation supports separation of concerns (for example, functionality and different QoS properties) and dynamic adaptation to changing environments or requirements. In such an ODS, a wide range of services and activities must execute concurrently and share resources. To avoid resource conflicts, deadlocks, inconsistencies, and incorrect execution semantics, the underlying resource management system--middleware--must ensure that concurrent system activities compose in a correct manner. Designers and programmers must consider interactions within and across reflective levels, clearly spell out the semantics of shared distributed resources, and develop new notions of overall system correctness that account for a dynamic,distributed, and reflective setting.
Learning from What Others Know: Privacy Preserving Cross System Personalization
Authors: Bhaskar Mehta
Venue: Proceedings of the 11th international conference on User Modeling (2007)

Recommender systems have been steadily gaining popularity and have been deployed by several service providers. Large scalable deployment has however highlighted one of the design problems of recommender systems: lack of interoperability. Users today often use multiple electronic systems offering recommendations, which cannot learn from one another. The result is that the end user has to often provide similar information and in some cases disjoint information. Intuitively, it seems that much can be improved with this situation: information learnt by one system could potentially be reused by another, to offer an overall improved personalization experience. In this paper, we provide an effective solution to this problem using Latent Semantic Models by learning a user model across multiple systems. A privacy preserving distributed framework is added around the traditional Probabilistic Latent Semantic Analysis framework, and practical aspects such as addition of new systems and items are also dealt with in this work.
A Protocol for Building Secure and Reliable Covert Channel
Authors: Baishakhi Ray, Shivakant Mishra
Venue: Proceedings of the 2008 Sixth Annual Conference on Privacy, Security and Trust (2008)

This paper presents a secure and lightweight protocol for reliable data transfer through moderate bandwidth covert channels. Though data transfer through covert channels is not unprecedented, existing covert channels have been restricted to covert transmission of only small amounts of data. This paper demonstrates that it is possible to transmit large amounts of data covertly with sophisticated support such as security and reliability. The proposed protocol exploits ICMP Echo Request as covert medium, and uses OS finger-printing techniques to simulate real TCP/IP stack behavior for further security enhancements.
Recurrent Method for Blocking Probability Calculation in Multi-service Switching Networks with BPP Traffic
Authors: Mariusz Głąbowski
Venue: Proceedings of the 5th European Performance Engineering Workshop on Computer Performance Engineering (2008)

This paper presents a new approximate analytical recurrent calculation method of the occupancy distribution and the blocking probability in switching networks which are offered multi-service traffic streams generated by Binomial (Engset) Poisson (Erlang) Pascal traffic sources (BPP traffic). The method is based on the concept of effective availability. The proposed calculation algorithm is based on the recurrent calculation of blocking probability in subsequent subsystems of the switching network. These calculations involve determination of occupancy distributions in interstage links as well as in the outgoing links. These distributions are calculated by means of the full-availability group model and the limited-availability group model. The results of analytical calculations of the blocking probabilities are compared with the simulation results of 3-stage and 5-stage switching networks.
Alwin Walther, IPM, and the Development of Calculator/Computer Technology in Germany, 1930-1945
Authors: Wilfried de Beauclair
Venue: IEEE Annals of the History of Computing (1986)

The article discusses the work of the lnstitut für Praktische Mathematik (IPM) at the Technische Hochschule in Darmstadt, Germany, from 1930 to 1945, and how Alwin Walther (1898-1967) guided IPM in developing calculator and computer technology during that period.
A study of the modification of the speed and size of the cursor for simulating pseudo-haptic bumps and holes
Authors: Anatole Lécuyer, Jean-Marie Burkhardt, Chee-Hian Tan
Venue: ACM Transactions on Applied Perception (TAP) (2008)

In previous work on so-called pseudo-haptic textures, we investigated the possibility of simulating sensations of texture without haptic devices by using the sole manipulation of the speed of a mouse cursor (a technique called speed technique). In this paper, we describe another technique (called Size technique) to enhance the speed technique and simulate texture sensations by varying the size of the cursor according to the local height of the texture displayed on the computer screen. With the size technique, the user would see an increase (decrease) in cursor size corresponding to a positive (negative) slope of the texture. We have conducted a series of experiments to study and compare the use of both the size and speed technique for simulating simple shapes like bumps and holes. In Experiment 1, our results showed that participants could successfully identify bumps and holes using the size technique alone. Performances obtained with the size technique reached a similar level of accuracy as found previously with the speed technique alone. In Experiment 2, we determined a point of subjective equality between bumps simulated by each technique separately, which suggests that the two techniques provide information that can be perceptually equivalent. In Experiment 3, using paradoxical situations of conflict between the two techniques, we have found that participants' answers were more influenced by the size technique, suggesting a dominance of the size over the speed technique. Furthermore, we have found a mutual reinforcement of the techniques, i.e., when the two techniques were consistently combined, the participants were more efficient in identifying the simulated shapes. In Experiment 4, we further observed the complex interactions between the information associated with the two techniques in the perception and in the decision process related to the accurate identification of bumps and holes. Taken together, our results promote the use of both techniques for the low-cost simulation of texture sensations in applications, such as videogames, internet, and graphical user interfaces.
Classify and Diagnose Individual Stress Using Calibration and Fuzzy Case-Based Reasoning
Authors: Shahina Begum, Mobyen Uddin Ahmed, Peter Funk, Ning Xiong, Bo Schéele
Venue: Proceedings of the 7th international conference on Case-Based Reasoning: Case-Based Reasoning Research and Development (2007)

Increased exposure to stress may cause health problems. An experienced clinician is able to diagnose a person's stress level based on sensor readings. Large individual variations and absence of general rules make it difficult to diagnose stress and the risk of stress-related health problems. A decision support system providing clinicians with a second opinion would be valuable. We propose a novel solution combining case-based reasoning and fuzzy logic along with a calibration phase to diagnose individual stress. During calibration a number of individual parameters are established. The system also considers the feedback from the patient on how well the test was performed. The system uses fuzzy logic to incorporating the imprecise characteristics of the domain. The cases are also used for the individual treatment process and transfer experience between clinicians. The validation of the approach is based on close collaboration with experts and measurements from 24 persons used as reference.
Strong convergence theorems for three-step iterations with errors for non-lipschitzian nonself-mappings in Banach spaces
Authors: S. Plubtieng, R. Wangkeeree
Venue: Computers Mathematics with Applications (2006)

Suppose C is a nonempty closed convex subset of a real uniformly convex Banach space X with P is a nonexpansive retraction of X onto C. Let T : C -> X be an asymptotically nonexpansive in the intermediate sense nonself-mapping. In this paper, we introduced the three-step iterative sequence for such map with errors. Moreover, we prove that, if T is completely continuous, then the three-step iterative sequences converges strongly to a fixed point of T.
A proposal for gps-less location detection using a reference direction information sharing method with co-operation of mobile terminals
Authors: Jun Hirano
Venue: Proceedings of the first ACM international workshop on Mobile entity localization and tracking in GPS-less environments (2008)

This paper describes a proposal for wireless communication system and mobile terminals, especially useful for location based service without using GPS receiver in the service area. The Global Positioning System (GPS) or gyroscope sensor (gyrocompass) terminals are known as a technology to provide location information. However, GPS may not provide enough accuracy in a building, an underground complex or downtown area among high buildings. In this proposed wireless communication system, mobile terminals can obtain reference direction information and share the reference direction information at same time. This is achieved by having mobile terminals sharing signals received from reference stations installed in the service area to other mobile terminals. The proposed wireless communication system can be expected to provide advanced service using location/direction information.
Evaluation of an Augmented Photograph-Based Pedestrian Navigation System
Authors: Benjamin Walther-Franks, Rainer Malaka
Venue: Proceedings of the 9th international symposium on Smart Graphics (2008)

Map interfaces are the quasi-standard for car navigation systems, and are usually the first choice for mobile pedestrian navigation systems. Alternatives are being investigated in research and industry that possibly suit the settings and needs of the person on foot better. One solution is augmented reality (AR), which blends navigation instructions with the view of the real world. However, research usually focuses too much on the technical implementation, leaving little time for a thorough assessment of the actual benefits of such a system. In this paper we present an evaluation of a mobile pedestrian navigation system prototype. The system provides a simplified augmented reality experience by presenting visually augmented photographs instead of a real-time video stream. We compare the usability of the AR interface with that of a map-based interface in a field evaluation. Our results challenge the map approach and suggest that AR is not only a serious alternative, but also potentially more suited for route presentation in PNS.
Necessary conditions for Schur-positivity
Authors: Peter R. Mcnamara
Venue: Journal of Algebraic Combinatorics: An International Journal (2008)

In recent years, there has been considerable interest in showing that certain conditions on skew shapes A and B are sufficient for the difference s A ¿s B of their skew Schur functions to be Schur-positive. We determine necessary conditions for the difference to be Schur-positive. Specifically, we prove that if s A ¿s B is Schur-positive, then certain row overlap partitions for A are dominated by those for B. In fact, our necessary conditions require a weaker condition than the Schur-positivity of s A ¿s B ; we require only that, when expanded in terms of Schur functions, the support of s A contains that of s B . In addition, we show that the row overlap condition is equivalent to a column overlap condition and to a condition on counts of rectangles fitting inside A and B. Our necessary conditions are motivated by those of Reiner, Shaw and van Willigenburg that are necessary for s A =s B , and we deduce a strengthening of their result as a special case.
Hilbert-Huang Transform Analysis of Dynamic Differential Pressure Signal of Gas-Liquid Two-Phase Flow
Authors: Bin Sun, Yongjun Zheng
Venue: Proceedings of the 2008 Congress on Image and Signal Processing, Vol. 5 - Volume 05 (2008)

The dynamic differential pressure signal of gas-liquid two-phase flow has close relation with the parameter measurement of fluid’s flow pattern, flux and void fraction. After the dynamic differential pressure signal passing through the cut-off equipment was done by Hilbert-Huang transform, the fluctuation and steady ingredient of the signal was withdrawn. The further analysis indicated that this method can be applied for the measurement of void fraction of two-phase flow. This method can avoid the insufficiency of conventional signal processing method, and provide a new method for carrying on two-phase flow multi-parameters measurement by using traditional single-phase flow equipment.
EBI Proteomics Services
Authors: Henning Hermjakob
Venue: Proceedings of the 5th international workshop on Data Integration in the Life Sciences (2008)

We will provide an overview of recent developments in the tools and resources provided by the EBI Proteomics Services Team.The IntAct molecular interaction database (http://www.ebi.ac.uk/intact)[1] now offers 163.000 curated binary molecular interactions. Using the Distributed Annotation System (DAS)[2] and DASTY (http://www.ebi.ac.uk/dasty), we are currently enhancing the IntAct molecular view through direct integration with external resources, in particular UniProt and ChEBI. We will provide a detailed view of the process and our experience using DAS for data integration and robust data maintenance.The PRIDE proteomics identifications database (http://www.ebi.ac.uk/pride) [3] provides more than 500.000 protein identifications, supported by more than 3 million identified peptides. We will report on recent improvements to data submission system and interface, in particular the visualization of PRIDE peptides through DAS, as well as PRIDE protein sets on Reactome pathways.A major challenge not only, but particularly in proteomics data resources is the efficient management of consistent protein identifiers and controlled vocabularies. We will describe two major tools to address these tasks, the PICR Protein Identifier Cross-Referencing service (http://www.ebi.ac.uk/Tools/picr), and the OLS Ontology Lookup Service (http://www.ebi.ac.uk/ols). PICR provides high quality mapping between protein identifier namespaces, based on a database of more than 15 million unique protein sequences and associated identifiers. OLS provides efficient access to currently almost 700.000 terms from 60 controlled vocabularies in OBO format. Both systems provide interactive as well as web service access, and are publicly available without restrictions.