ppxscal/embedding_network huggingface dataset:
Efficient and Robust TCP Stream Normalization
Authors: Mythili Vutukuru, Hari Balakrishnan, Vern Paxson
Venue: Proceedings of the 2008 IEEE Symposium on Security and Privacy (2008)

Network intrusion detection and prevention systems are vulnerable to evasion by attackers who craft ambiguous traffic to breach the defense of such systems. A normalizer is an inline network element that thwarts evasion attempts by removing ambiguities in network traffic. A particularly challenging step in normalization is the sound detection of inconsistent TCP retransmissions, wherein an attacker sends TCP segments with different payloads for the same sequence number space to present a network monitor with ambiguous analysis. Normalizers that buffer all unacknowledged data to verify the consistency of subsequent retransmissions consume inordinate amounts of memory on high-speed links. On the other hand, normalizers that buffer only the hashes of unacknowledged segments cannot verify the consistency of 20-30% of retransmissions that, according to our traces, do not align with the original transmissions. This paper presents the design of RoboNorm, a normalizer that buffers only the hashes of unacknowledged segments, and yet can detect all inconsistent retransmissions in any TCP byte stream. RoboNorm consumes 1-2 orders of magnitude less memory than normalizers that buffers all unacknowledged data, and is amenable to a high-speed implementation. RoboNorm is also robust to attacks that attempt to compromise its operation or exhaust its resources.
Neurodynamics of the prefrontal cortex during conditional visuomotor associations
Authors: Marco Loh, Anitha Pasupathy, Earl K. Miller, Gustavo Deco
Venue: Journal of Cognitive Neuroscience (2008)

The prefrontal cortex is believed to be important for cognitive control, working memory, and learning. It is known to play an important role in the learning and execution of conditional visuomotor associations, a cognitive task in which stimuli have to be associated with actions by trial-and-error learning. In our modeling study, we sought to integrate several hypotheses on the function of the prefrontal cortex using a computational model, and compare the results to experimental data. We constructed a module of prefrontal cortex neurons exposed to two different inputs, which we envision to originate from the inferotemporal cortex and the basal ganglia. We found that working memory properties do not describe the dominant dynamics in the prefrontal cortex, but the activation seems to be transient, probably progressing along a pathway from sensory to motor areas. During the presentation of the cue, the dynamics of the prefrontal cortex is bistable, yielding a distinct activation for correct and error trails. We find that a linear change in network parameters relates to the changes in neural activity in consecutive correct trials during learning, which is important evidence for the underlying learning mechanisms.
High-resolution movement EEG classification
Authors: Jakub Šťastny, Pavel Sovka
Venue: Computational Intelligence and Neuroscience (2007)

The aim of the contribution is to analyze possibilities of high-resolution movement classification using human EEG. For this purpose, a database of the EEG recorded during right-thumb and little-finger fast flexion movements of the experimental subjects was created. The statistical analysis of the EEG was done on the subject's basis instead of the commonly used grand averaging. Statistically significant differences between the EEG accompanying movements of both fingers were found, extending the results of other so far published works. The classifier based on hidden Markov models was able to distinguish between movement and resting states (classification score of 94-100%), but it was unable to recognize the type of the movement. This is caused by the large fraction of other (nonmovement related) EEG activities in the recorded signals. A classification method based on advanced EEG signal denoising is being currently developed to overcome this problem.
Improved bounds on sorting by length-weighted reversals
Authors: Michael A. Bender, Dongdong Ge, Simai He, Haodong Hu, Ron Y. Pinter, Steven Skiena, Firas Swidan
Venue: Journal of Computer and System Sciences (2008)

We study the problem of sorting binary sequences and permutations by length-weighted reversals. We consider a wide class of cost functions, namely f(@?)=@?^@a for all @a>=0, where @? is the length of the reversed subsequence. We present tight or nearly tight upper and lower bounds on the worst-case cost of sorting by reversals. Then we develop algorithms to approximate the optimal cost to sort a given input. Furthermore, we give polynomial-time algorithms to determine the optimal reversal sequence for a restricted but interesting class of sequences and cost functions. Our results have direct application in computational biology to the field of comparative genomics.
Core business architecture for a service-oriented enterprise
Authors: N. Nayak, M. Linehan, A. Nigam, D. Marston, J.-J. Jeng, F. Y. Wu, D. Boullery, L. F. White, P. Nandi, J. L. C. Sanz
Venue: IBM Systems Journal (2007)

The business architecture of a service-oriented enterprise can be adequately represented through five main architectural domains: business value, structure, behavior, policy, and performance. In this paper we focus on the core business architecture, the set of essential elements in each of the five domains, and the interrelationships among these elements. The business architecture described in this paper identifies the key elements required for business reasoning and for its application to business transformation through service-oriented solutions. A business scenario involving a fictional company in the apparel business illustrates the concepts presented here.
Continuity Properties of Preference Relations
Authors: Marian Baroni, Douglas Bridges
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2008)

Various types of continuity for preference relations on a metric space are examined constructively. In particular, necessary and sufficient conditions are given for an order-dense, strongly extensional preference relation on a complete metric space to be continuous. It is also shown, in the spirit of constructive reverse mathematics, that the continuity of sequentially continuous, order-dense preference relations on complete, separable metric spaces is connected to Ishihara's principle BD-N, and therefore is not provable within Bishop-style constructive mathematics alone.
A neural network-based approach for dynamic quality prediction in a plastic injection molding process
Authors: Wen-Chin Chen, Pei-Hao Tai, Min-Wen Wang, Wei-Jaw Deng, Chen-Tai Chen
Venue: Expert Systems with Applications: An International Journal (2008)

This paper presents an innovative neural network-based quality prediction system for a plastic injection molding process. A self-organizing map plus a back-propagation neural network (SOM-BPNN) model is proposed for creating a dynamic quality predictor. Three SOM-based dynamic extraction parameters with six manufacturing process parameters and one level of product quality were dedicated to training and testing the proposed system. In addition, Taguchi's parameter design method was also applied to enhance the neural network performance. For comparison, an additional back-propagation neural network (BPNN) model was constructed for which six process parameters were used for training and testing. The training and testing data for the two models respectively consisted of 120 and 40 samples. Experimental results showed that such a SOM-BPNN-based model can accurately predict the product quality (weight) and can likely be used for various practical applications.
Automatic documentation inference for exceptions
Authors: Raymond P.L. Buse, Westley R. Weimer
Venue: Proceedings of the 2008 international symposium on Software testing and analysis (2008)

Exception handling is a powerful and widely-used programming language abstraction for constructing robust software systems. Unfortunately, it introduces an inter-procedural flow of control that can be difficult to reason about. Failure to do so correctly can lead to security vulnerabilities, breaches of API encapsulation, and any number of safety policy violations. We present a fully automated tool that statically infers and characterizes exception-causing conditions in Java programs. Our tool is based on an inter-procedural, context-sensitive analysis. The output of this tool is well-suited for use as human-readable documentation of exceptional conditions. We evaluate the output of our tool by comparing it to over 900 instances of existing exception documentation in almost two million lines of code. We find that the output of our tool is at least as good as existing documentation 85% of the time and is better 25% of the time.
A Case Study to Evaluate Pros/Cons of Aspect- and Object-Oriented Paradigms to Model Distributed Embedded Real-Time Systems
Authors: Marco A. Wehrmeister, Edison Freitas, Dalimir Orfanus, Carlos E. Pereira, Franz Rammig
Venue: Proceedings of the 2008 5th International Workshop on Model-based Methodologies for Pervasive and Embedded Software (2008)

The growing design complexity of today’sembedded real-time systems requires new techniquesaiming the raising of the abstraction level since earlierstages of design in order to deal with such complexityin a suitable way. This paper reports a case study,which provides an assessment of two well-know highlevelparadigms, namely Aspect- (AO) and Object-Oriented (OO) paradigms. Concepts of bothparadigms were applied at modeling phase of aDistributed Embedded Real-Time System (DERTS).The handling of DERTS’ functional and non-functionalrequirements (at modeling level) using AO and OOconcepts is discussed. Both paradigms are comparedusing of a set of software engineering metrics, whichwere adapted to be applied at modeling level. Thepresented results show the suitability of each paradigmfor DERTS specification in terms of reusability qualityof model elements.
Global/Local Hashed Perceptron Branch Prediction
Authors: Anthony S. Fong, C. Y. Ho
Venue: Proceedings of the Fifth International Conference on Information Technology: New Generations (2008)

This paper introduces combining local history hashing and global history hashing in perceptron branch prediction. The proposed perceptron predictor utilizes self-history as well as global history in indexing different weights of a perceptron. The simulation results show that our proposed perceptron predictor is more accurate than the one using either global history hashing or local history hashing alone. Our proposed perceptron predictor improves the misprediction rate by up to 26.9% over path-based neural predictor, and 17.2% over hashed perceptron predictor. A reducing aliasing approach is employed to improve the accuracy of our proposed perceptron predictor by diminishing the impact of destructive interference, supported by the simulation results.
Follow Me, Follow You - Spatiotemporal Community Context Modeling and Adaptation for Mobile Information Systems
Authors: Yiwei Cao, Ralf Klamma, Min Hou, Matthias Jarke
Venue: Proceedings of the The Ninth International Conference on Mobile Data Management (2008)

Nowadays various mobile platforms from PDA, smart phones to iPhones can deliver road warriors or trippers much mobile information. However, most mobile applications are lacking the "social intelligence" of real companionship. One reason is that community context and spatiotemporal context information are not well taken into consideration. In this paper we propose an ontology-based context model using OWL/RDF. With the enhanced interoperability substantial context information can be expressed and reasoned across systems. Based on the context model and the middleware Context-Aware Adaptation Service (CAAS), we introduce a mobile tourist guide as proof-of-concept that provides users context-aware information. We employ the MPEG-7 and MPEG-21 metadata standards to realize multimedia adaptation to device preferences. The evaluation result proves the feasibility of the context model and shows the easy extensibility of CAAS.
Building a story tracer out of a web archive
Authors: Lian'en Huang, Jonathan J. H. Zhu, Xiaoming Li
Venue: Proceedings of the 8th ACM/IEEE-CS joint conference on Digital libraries (2008)

There are quite a few web archives around the world, such as Internet Archive and Web InfoMall (http://www.infomall.cn). Nevertheless, we have not seen substantial mechanism built on top of the archives to render the value of the data beyond what the Wayback machine offers. One of the reasons for this situation is the lack of a system vision and design which encompasses the oceanic data in a meaningful and cost-effective way. This paper describes an effort in this direction.
Role-based trust management security policy analysis and correction environment (RT-SPACE)
Authors: Mark Reith, Jianwei Niu, William H. Winsborough
Venue: Companion of the 30th international conference on Software engineering (2008)

This paper presents RT-SPACE, a tool suite for authoring, verifying, and correcting RT access control policies. RT is a role-based trust management framework well suited for use in systems that must protect the interests of multiple stakeholders in a decentralized environment.
QBIST: Quantum Built-in Self-Test for any Boolean Circuit
Authors: Yao-Hsin Chou, Sy-Yen Kuo, I-Ming Tsai
Venue: Proceedings of the 26th IEEE VLSI Test Symposium (2008)

Recently, a systematic procedure was proposed to derive a minimum space quantum circuit for any given classical logic with the generalized quantum Toffoli gate which is universal in boolean logic. Since quantum computation is reversible, we can apply this property to build quantum iterative logic array (QILA). QILA can be easily tested in constant time (C-testable) if stuck-at fault model is assumed. In this paper, we use Hadamard and general CCN gates to make QILA 1-testable. That is, for any quantum boolean circuit, the number of test patterns is independent of both the size of the array and the length of the inputs. This property can be applied to perform the quantum built-in self-test (QBIST), which makes any boolean circuit 1-testable.
Investigating software process in practice: A grounded theory perspective
Authors: Gerry Coleman, Rory O'Connor
Venue: Journal of Systems and Software (2008)

This paper presents the results of a study of how software process and software process improvement (SPI) is applied in actual practice in the software industry using the indigenous Irish software product industry as a test-bed. The study used the grounded theory methodology to produce a theory, grounded in the field data, that explains how software processes are formed and evolve and when and why SPI is undertaken. Our research found that SPI programmes are implemented reactively and many software managers are reluctant to implement SPI best practice models because of the associated costs.
Enhancing web browsing security on public terminals using mobile composition
Authors: Richard Sharp, Anil Madhavapeddy, Roy Want, Trevor Pering
Venue: Proceeding of the 6th international conference on Mobile systems, applications, and services (2008)

This paper presents an architecture that affords mobile users greater trust and security when browsing the internet (e.g., when making personal/financial transactions) from public terminals at Internet Cafes or other unfamiliar locations. This is achieved by enabling web applications to split their client-side pages across a pair of browsers: one untrusted browser running on a public PC and one trusted browser running on the user's personal mobile device, composed into a single logical interface through a local connection, wired or wireless. Information entered via the personal device's keypad cannot be read by the PC, thwarting PC-based key-loggers. Similarly, information displayed on the personal device's screen is also hidden from the PC, preserving the confidentiality and integrity of security-critical data even in the presence of screen grabbing attacks and compromised PC browsers. We present a security policy model for split-trust web applications that defends against a range of crimeware-based attacks, including those based on active-injection (e.g. inserting malicious packets into the network or spoofing user-input events). Performance results of a prototype split-trust implementation are presented, using a commercially available cell phone as a trusted personal device.
Tunable Fabry-Perot surface micromachined interferometer-experiments and modeling
Authors: Raluca M&#x00fc;ller, Dana Cristea, C. Tibeica, P. Arguel, P. Pons, F. Rossel, D. Syvridis, M. Kusko
Venue: Microsystem Technologies (2005)

We present an optical tunable Fabry-Perot micromachined interferometer. The device is monolithically integrated with a p+-n photodiode on a silicon substrate, providing an adequate positioning of the photonic and microoptical components. The Fabry-Perot micro-interferometer consists of two parallel mirrors and lets the light with a particular wavelength pass through. The wavelength depends on the gap between the mirrors. We can change the gap of the micro-mechanical Fabry-Perot interferometer by applying a voltage to the mirrors, an electrostatic force inducing an attraction between the substrate and the top mirror. A simulation of the mechanical behavior was performed based on finite elements, using CoventorWare software. The method included an electro-mechanical simulation for a square parallel plate actuation with four connecting beams. The finite elements method (FEM) simulations of the device (the Fabry-Perot tunable filter) are performed for optimizing the design parameters in order to model the overall system performance, both the steady-state behavior and dynamic response.
Dynamic Policy Updating Based on One-Point Coverage Random Sets Theory
Authors: Wei Da, Yan-heng Liu, Lian-deng Li, Xue-jie Liu, Hai-yan Hu
Venue: Proceedings of the First International Workshop on Knowledge Discovery and Data Mining (2008)

Aiming at the dynamic policy trigger problem in policy based network management, this thesis first introduces the uncertain information generated by onepoint coverage random sets theory and also the unified framework of fuzzy information. On the basis of which, according to the feature of policy based network management, a model used to update the predicted information using present known information, experience, and knowledge is designed. At the same time, this thesis put forward that, take the semblance of policy as constant probability in product space conditional event algebra, so as to execute information fusion of multiple sets of related policy. In the end, compared with the policy based inference system and then analyze the result.
On the complexity of space bounded interactive proofs
Authors: A. Condon
Venue: Proceedings of the 30th Annual Symposium on Foundations of Computer Science (1989)

Two results on interactive proof systems with two-way probabilistic finite-state verifiers are proved. The first is a lower bound on the power of such proof systems if they are not required to halt with high probability on rejected inputs: it is shown that they can accept any recursively enumerable language. The second is an upper bound on the power of interactive proof systems that halt with high probability on all inputs. The proof method for the lower bound also shows that the emptiness problem for one-way probabilistic finite-state machines is undecidable. In the proof of the upper bound some results of independent interest on the rate of convergence of time-varying Markov chains to their halting states are obtained.
The Future of the Internet--And How to Stop It
Authors: Jonathan Zittrain
Venue:  (2008)

This extraordinary book explains the engine that has catapulted the Internet from backwater to ubiquityand reveals that it is sputtering precisely because of its runaway success. With the unwitting help of its users, the generative Internet is on a path to a lockdown, ending its cycle of innovationand facilitating unsettling new kinds of control.IPods, iPhones, Xboxes, and TiVos represent the first wave of Internet-centered products that cant be easily modified by anyone except their vendors or selected partners. These tethered appliances have already been used in remarkable but little-known ways: car GPS systems have been reconfigured at the demand of law enforcement to eavesdrop on the occupants at all times, and digital video recorders have been ordered to self-destruct thanks to a lawsuit against the manufacturer thousands of miles away. New Web 2.0 platforms like Google mash-ups and Facebook are rightly toutedbut their applications can be similarly monitored and eliminated from a central source. As tethered appliances and applications eclipse the PC, the very nature of the Internetits generativity, or innovative characteris at risk.The Internets current trajectory is one of lost opportunity. Its salvation, Zittrain argues, lies in the hands of its millions of users. Drawing on generative technologies like Wikipedia that have so far survived their own successes, this book shows how to develop new technologies and social structures that allow users to work creatively and collaboratively, participate in solutions, and become true netizens.
Testability analysis based on the identification of testable blocks with predefined properties
Authors: Jaroslav Skarvada, Zdenek Kotasek, Tomas Herrman
Venue: Microprocessors Microsystems (2008)

The paper presents testability analysis method that is based on partitioning circuit under analysis (CUA) into testable blocks (TBs). The concept of TBs is further utilized for power consumption reduction during the test application. Software tools which were developed during the research and integrated into the third party design flow are also described. The experimental results gained from the application of the methodology on selected benchmarks and practical designs are demonstrated. It was proven on the benchmarks, used for the verification of the methodology, that a fault coverage comparable to the partial scan method can be obtained. When combined with test vectors/scan cells reordering methodology significant power savings can be reached.
Numerical simulation of flow for viscoelastic neutrophil models in a rectangular capillary network: Effects of capillary shape and cell stiffness on transit time
Authors: Atsushi Shirai, Ryo Fujita, Toshiyuki Hayase
Venue: Technology and Health Care (2007)

The concentration of neutrophils in the pulmonary microvasculature is higher than in large systemic vessels. It is thought that the high concentration of neutrophils facilitates their effective recruitment to sites of inflammation. Thus, in order to understand the role of neutrophils in the immune system, it is important to clarify their flow characteristics in the pulmonary microvasculature. In a previous study, we developed a model to simulate the flow of neutrophils in a capillary network, in which the cells were modeled as spheres of a Maxwell material with a cortical tension and the capillary segments were modeled as arc-shaped constrictions in straight pipes. In the present paper, the flow of neutrophils in a simplified alveolar capillary network model is investigated for various constriction shapes and cell stiffnesses. Finally, it is shown that both the coefficient of variation of the transit time of the cells, which is the standard deviation divided by the mean transit time, and the mean transit time increase as the capillary segments become steep or tight, or when the cells become hard. The mean value of the transit time exceeds the median for all of the conditions that occur in real lungs, although the difference between them is small.