ppxscal/embedding_network huggingface dataset:
Automatic Enforcement of Security in Computer Networks
Authors: T. Mechri, M. Langar, M. Mejri, H. Fujita, Y. Funyu
Venue: Proceeding of the 2007 conference on New Trends in Software Methodologies, Tools and Techniques: Proceedings of the sixth SoMeT_07 (2007)

The main issue of this paper is to propose a formal technique allowing to automatically configure a given network so that it will respect a given security policy. In other words, given a computer network N and a security policy Φ, we introduce a formal technique that automatically produce another network N' such that N' $\vDash$ Φ and N and N' behaves in an "equivalent" (with respect to a given de finition of equivalence) way. To that end, we define a new process algebra allowing to better specify and analyze monitored network. We also define an operator $\otimes$ that produce from an initial network N and a security policy Φ another version of the network, denoted by N $\otimes$ Φ, configured in such a way that the security policy is always respected.
Comparison of AMSR-E and TMI sea surface temperature with Argo near-surface temperature over the Indian Ocean
Authors: T. V. S. Udaya Bhaskar, S. H. Rahman, I. D. Pavan, M. Ravichandran, S. Nayak
Venue: International Journal of Remote Sensing (2009)

Sea surface temperature (SST) measurements from the Advanced Microwave Scanning Radiometer for the Earth Observing System (AMSR-E) and the Tropical Rainfall Measuring Mission (TRMM) Microwave Imager (TMI) are compared with near-surface temperature (foundation SST) in situ measurements obtained from Argo floats over the Indian Ocean. Spatial variation was compared for 2002-2006 and 11 floats were used for temporal variation collocated observations. The results show that TMI and AMSR-E SST measurements are slightly overestimated during the pre-and post-monsoon seasons and underestimated during the monsoon season. Statistical analysis shows that the SST from the AMSR-E is better correlated with the Argo foundation SST compared to the TMI. The standard deviation (SD) and root mean square error (RMSE) for AMSR-E SST are 0.58°C and 0.35°C, respectively, over the Equatorial Indian Ocean (EIO). The corresponding values for the TMI are 0.66°C and 0.47°C. Over the Arabian Sea the SD values are slightly higher compared to the EIO values, whereas RMSE values are less for both TMI and AMSR-E SST. These retrieval accuracies are above the expected retrieval accuracy. The seasonal average spatial distribution of AMSR-E SST shows a better match with the Argo foundation SST compared to TMI SST distributions. The robustness of the good spatial match during the monsoon season may be attributed to strong winds.
A novel hash-based approach for mining frequent itemsets over data streams requiring less memory space
Authors: En Tzu Wang, Arbee L. Chen
Venue: Data Mining and Knowledge Discovery (2009)

In recent times, data are generated as a form of continuous data streams in many applications. Since handling data streams is necessary and discovering knowledge behind data streams can often yield substantial benefits, mining over data streams has become one of the most important issues. Many approaches for mining frequent itemsets over data streams have been proposed. These approaches often consist of two procedures including continuously maintaining synopses for data streams and finding frequent itemsets from the synopses. However, most of the approaches assume that the synopses of data streams can be saved in memory and ignore the fact that the information of the non-frequent itemsets kept in the synopses may cause memory utilization to be significantly degraded. In this paper, we consider compressing the information of all the itemsets into a structure with a fixed size using a hash-based technique. This hash-based approach skillfully summarizes the information of the whole data stream by using a hash table, provides a novel technique to estimate the support counts of the non-frequent itemsets, and keeps only the frequent itemsets for speeding up the mining process. Therefore, the goal of optimizing memory space utilization can be achieved. The correctness guarantee, error analysis, and parameter setting of this approach are presented and a series of experiments is performed to show the effectiveness and the efficiency of this approach.
Formal Techniques for Java-Like Programs
Authors: Elvira Albert, Anindya Banerjee, Sophia Drossopoulou, Marieke Huisman, Atsushi Igarashi, Gary T. Leavens, Peter Müller, Tobias Wrigstad
Venue: Object-Oriented Technology. ECOOP 2008 Workshop Reader: ECOOP 2008 Workshops Paphos, Cyprus, July 7-11, 2008 Final Reports (2008)

This report gives an overview of the 10th Workshop on Formal Techniques for Java-like Programs at ECOOP 2008. It explains the motivation for the workshop, and summarizes the presentations and discussions.
Query-page intention matching using clicked titles and snippets to boost search rankings
Authors: Masaya Murata, Hiroyuki Toda, Yumiko Matsuura, Ryoji Kataoka
Venue: Proceedings of the 9th ACM/IEEE-CS joint conference on Digital libraries (2009)

Users of text retrieval systems input only a few keywords or sometimes just one keyword to the systems even if they had complex information needs. Due to the lack of query keywords, it becomes hard to return relevant search results that satisfy the demands of each user. Because digital documents, in contrast to queries, are generally composed of many kinds of keywords, it is also difficult to estimate the main topic or grasp the inherent intentions of the documents. In this paper, we present techniques to represent users' search intentions and the intentions that digital documents can satisfy by making use of clicked titles and snippets acquired from a click log analysis. We then present a method to match these intentions to boost search result rankings. Through experiments that use click logs and indexes of a commercial search engine, we verified our method's capability of significantly improving search precision.
Formulation of Clamshell Diagram and Its Application to Source Code Reading
Authors: Takehiko Murakawa, Takayoshi Kawasaki, Hirofumi Mizuochi, Masaru Nakagawa
Venue: Proceeding of the 2008 conference on Knowledge-Based Software Engineering: Proceedings of the Eighth Joint Conference on Knowledge-Based Software Engineering (2008)

When describing an idea using letters and diagrams, the concept becomes clear and it is easier to see what to do to achieve a goal. Among the design creation support tools, we focus attention on the Thinking Process Development Diagram of 6 layers. We refer to it as a Clamshell Diagram, and present 16 principles to constitute the diagram. Then we report the support system for drawing the diagrams using a Web browser. Design creation support tools are also useful for analyzing the existing good or bad instances. We therefore attempt to investigate how to represent a source code by means of Clamshell Diagram and apply to GNU Hello to draw a diagram. Using the diagram representation of source code, we can see the whole-part relationship and the problem-solution relationship at a time.
Secure data recollection for redundantly deployed wireless sensor networks
Authors: Luis E. Palafox, J. Antonio Garcia-Macias
Venue: Proceedings of the 2008 International Symposium on a World of Wireless, Mobile and Multimedia Networks (2008)

Monitoring the environment is one of the main applications of wireless sensor networks. Given that these networks are densely populated and that local variations in the environmental variables are small, a large amount of redundant data is generated by sensor nodes. In this paper we present a protocol for data dissemination in hierarchical sensor networks that integrates security and reduces communication overhead by removing data redundancy from the network. Furthermore, we show that by using our protocol we can provide security to the network without spending additional energy resources, particularly when we are dealing with high levels of redundancy.
Exploring Simulations in Science through the Virtual Lab Research Study: From NASA Kennedy Space Center to High School Classrooms
Authors: Laura Blasi
Venue: Proceeding of the 2005 conference on Artificial Intelligence in Education: Supporting Learning through Intelligent and Socially Informed Technology (2005)

Documenting the use of the Virtual Lab within nine high school biology classrooms in an urban school district in Florida, this study focuses on general science classes (i.e. not advanced or honors-level) within underserved populations over the 2004-2005 school year (n=225). The baseline data is presented from an administration of the Test of Science Related Attitudes (TOSRA) (Fraser, 1981) as the author shares preliminary analysis of the usability data in summer of 2005. With funding from the Bellsouth foundation, the researchers are contributing to the development of the 3d environment and the scanning electron microscope (SEM) simulation, in conjunction with the efforts of educational technology specialists at the Kennedy Space Center (KSC), NASA.
Simulation of a peer-to-peer collaborative architecture for supply chain management
Authors: Robert Signorile
Venue: Proceedings of the 7th WSEAS international conference on System science and simulation in engineering (2008)

We have developed a system that combines multi-agent architecture with P2P networks. We built our system on the JXTA model for P2P systems. Each peer agent can enter a peer group and communicate with members of that group. Thus, a peer agent can send out a request, each potential supplier of that request can join the peer group and can respond to the originating peer agent. The originating peer agent then can choose among these potential peer agent suppliers. This requesting/responding mechanism is implemented up and down the supply chain in a basic pull methodology.
The Semantic Web for Improving Dynamic Tourist Packages Commercialisation
Authors: Idoia Murua, Esteve Lladó, Bel Llodrá
Venue: Proceeding of the 2006 conference on Leading the Web in Concurrent Engineering: Next Generation Concurrent Engineering (2006)

The use of Semantic Web technologies allows us to annotate information sources on tourism services and products with the concepts included in a defined ontology. The enriched information can be used to match tailored package holidays to client preferences and according to real time availability. This paper presents the ANOTA project approach to aggregation of tourism information according to user and destination management strategy. The main hypothesis is that an official promotional tourist information portal can integrate tourism information from different sources and present it in an aggregated way, according to current user search and marketing strategy.
Efficient virtualization of scientific data
Authors: Joel Saltz
Venue:  (2008)

Availability of commodity components has made it affordable to build beowulf clusters with multi-level memory hierarchies, large storage space and computing resources. These systems have helped fuel data-intensive scientific applications like bio-informatics, imaging and oil reservoir and seismic simulation studies. These applications require generation and analysis of large multi-dimensional datasets. A highly abstracted view of this data would benefit scientists by hiding the complexity of data layout and integration and simplifying the process of developing analysis algorithms. Certain analysis processes require access to attribute values at individual points in the multi-dimensional space. A table-like view of the data would allow these processes to express their region of interest using queries on attributes. The scale of scientific datasets poses I/O and computational problems in providing structural access to datasets. Manual and automatic techniques like segmentation may be employed to annotate interesting regions that represent important concepts in the domain in question. This allows for more sophisticated semantic-access to the scientific datasets using terms that a scientist is familar with. The meaning of these terms is captured in ontologies and rules with well-defined semantics. Semantic-access allows the scientist to not only query the dataset using explicit annotations, but also on implicit annotations. Computing implicit annotations from explicit annotations and domain knowledge is called materialization. Efficiency in materialization and querying implicit information is necessary to allow semantic-access over large scientific datasets. In my research, I have investigated structural and semantic access to scientific datasets. Providing such accesses over large scientific datasets poses both I/O and computational problems. In the context of structural access, I have developed a middleware framework that can exploit a shared-nothing cluster configuration to optimize performance. The framework utilizes additional disk space to replicate parts of the dataset to improve performance and chooses the appropriate join algorithm based on dataset and system parameters. In the context of semantic-access, I have investigated the problem of materializing large ontologies using databases and querying them using spatial predicates. I have also investigated optimizing materialization of ontologies in a shared-nothing cluster environment. Our results indicate that coarse-grained parallelism may be exploited in many scenarios to provide efficient structural and semantic access to scientific datasets.
Impact of PDA temperature on electron trap energy and spatial distributions in SiO2/Al2O3 stack as the IPD in Flash memory cells
Authors: X. F. Zheng, W. D. Zhang, B. Govoreanu, J. F. Zhang, J. Van Houdt
Venue: Microelectronic Engineering (2009)

SiO"xN"y/high-@k dielectric stack will soon replace the conventional SiO"xN"y-based dielectric stacks in the future generations of flash memory cells. Characterizing and reducing electron traps in the high-@k layer is an important task, as the large trap density may limit the memory retention via the trap-assisted tunneling. Since the Post-deposition Annealing (PDA) has great impact on the microstructure of high-@k dielectric, it is important to understand how PDA affects the properties of electron traps, such as the trap density, energy and spatial distributions. It is demonstrated in this paper that, by using a recently developed two-pulse C-V measurement technique, the energy and spatial distributions of electron traps throughout the SiO"2/high-@k stack can be characterized, and PDA temperatures have different impacts on traps at different energy levels and spatial locations.
Output control of linear systems with unmodeled dynamics
Authors: A. A. Bobtsov, N. A. Nikolaev
Venue: Automation and Remote Control (2009)

Recently, an output control law for linear parametrically uncertain plants was proposed by one of the authors of this paper. Here, the feasibility of this approach is substantiated in the presence of unmodeled asymptotically stable dynamics. A theorem is proved which formulates the feasibility conditions for the control law for systems with unmodeled dynamics.
Scaling prospect of optically differential reconfigurable gate array VLSIs
Authors: Minoru Watanabe, Takenori Shiki, Fuminori Kobayashi
Venue: Analog Integrated Circuits and Signal Processing (2009)

Dynamic reconfigurable devices present new computational paradigms because programmable devices' activity and performance can be improved dramatically by increasing its reconfiguration frequency. Therefore, this paper presents designs of optically differential reconfigurable gate array (ODRGA) VLSIs using 0.18 μm and 0.35 μm CMOS process technologies. Although they are a type of programmable gate array, they can be reconfigured optically in nanoseconds. This paper also discusses future scaling prospects of ODRGA-VLSIs.
Construction of a Mindlin pseudospectral plate element and evaluating efficiency of the element
Authors: Y. Liu, N. Hu, C. Yan, X. Peng, B. Yan
Venue: Finite Elements in Analysis and Design (2009)

In this paper, a Mindlin pseudospectral plate element is constructed to perform static, dynamic, and wave propagation analyses of plate-like structures. Chebyshev polynomials are used as basis functions and Chebyshev-Gauss-Lobatto points are used as grid points. Two integration schemes, i.e., Gauss-Legendre quadrature (GLEQ) and Chebyshev points quadrature (CPQ), are employed independently to form the elemental stiffness matrix of the present element. A lumped elemental mass matrix is generated by only using CPQ due to the discrete orthogonality of Chebyshev polynomials and overlapping of the quadrature points with the grid points. This results in a remarkable reduction of numerical operations in solving the equation of motion for being able to use explicit time integration schemes. Numerical calculations are carried out to investigate the influence of the above two numerical integration schemes in the elemental stiffness formation on the accuracy of static and dynamic response analyses. By comparing with the results of ABAQUS, this study shows that CPQ performs slightly better than GLEQ in various plates with different thicknesses, especially in thick plates. Finally, a one dimensional (1D) and a 2D wave propagation problems are used to demonstrate the efficiency of the present Mindlin pseudospectral plate element.
Elicitation and utilization of application-level utility functions
Authors: Paul deGrandis, Giuseppe Valetto
Venue: Proceedings of the 6th international conference on Autonomic computing (2009)

We present a non-analytic approach to self-assessment for Autonomic Computing. Our approach leverages utility functions, at the level of an autonomic application, or even a single task or feature being exercised within that application. This paper describes the fundamental steps of our approach: instrumentation of the application; collection of exhaustive samples of runtime data about relevant quality attributes of the application, as well as characteristics of its runtime environment; elicitation of a utility function through statistical correlation over the collected data points; and embedding of code corresponding to the equation of the elicited utility function within the runtime of the application, which enables online evaluation of utility values. To illustrate our elicitation method, as well as our framework for instrumentation, monitoring, and utility function embedding/evaluation, we discuss our experience with two different case studies, with their results and implications.
Foreground Segmentation via Segments Tracking
Authors: Bogdan Kwolek
Venue: Proceedings of the International Conference on Computer Vision and Graphics: Revised Papers (2008)

In this paper we propose a video segmentation algorithm that in the final delineation of the object employs the graph-cut. A partitioning of the image based on pairwise region comparison is done at the beginning of each frame. A set of keypoints is tracked over time via optical flow to extract regions, which are likely to be parts of the object of interest. The tracked keypoints contribute towards better temporal coherence of the object segmentation. A probabilistic occupancy map of the object is extracted using such initial object segmentation and a probabilistic shape model. The map is utilized in a classifier that operates both on pixels and regions. The aim of the classifier is to extract a trimap consisting of foreground, background and unknown areas. The trimap is employed by graph-cut. The outcome of the graph-cut is used in on-line learning of the shape model. The performance of the algorithm is demonstrated on freely available test sequences.
Object Relationship Notation (ORN) for Database Applications: Enhancing the Modeling and Implementation of Associations, 1st edition
Authors: Bryon K. Ehlmann
Venue:  (2009)

Conceptually, a database consists of objects and relationships. Object Relationship Notation (ORN) is a simple notation that more precisely defines relationships by combining UML multiplicities with uniquely defined referential actions. Object Relationship Notation (ORN) for Database Applications: Enhancing the Modeling and Implementation of Associations shows how ORN can be used in UML class diagrams & database definition languages (DDLs) to better model & implement relationships & thus more productively develop database applications. For the database developer, it presents many examples of relationships modeled using ORN-extended class diagrams & shows how these relationships are easily mapped to an ORN-extended SQL or Object DDL. For the DBMS developer, it presents the specifications & algorithms needed to implement ORN in a relational and object DBMS. This book alsodescribes tools that can be downloaded or accessed via the Web. These tools allow databases to be modeled using ORN and implemented using automatic code generation that adds ORN support to Microsoft SQL Server and Progress Object Store.
Fast Packet Classification Using Condition Factorization
Authors: Alok Tongaonkar, R. Sekar, Sreenaath Vasudevan
Venue: Proceedings of the 7th International Conference on Applied Cryptography and Network Security (2009)

Rule-based packet classification plays a central role in network intrusion detection systems such as Snort. To enhance performance, these rules are typically compiled into a matching automaton that can quickly identify the subset of rules that are applicable to a given network packet. The principal metrics in the design of such an automaton are its size and the time taken to match packets at runtime. Previous techniques for this problem either suffered from high space overheads (i.e., automata could be exponential in the number of rules), or matching time that increased quickly with the number of rules. In contrast, we present a new technique that constructs polynomial size automata. Moreover, we show that the matching time of our automata is insensitive to the number of rules. Our experimental results demonstrate substantial improvements in space requirements, as well the runtime of Snort.
Evaluation of phrase-representation summarization based on information retrieval task
Authors: Mamiko Oka, Yoshihiro Ueda
Venue: NAACL-ANLP 2000 Workshop on Automatic Summarization (2000)

We have developed an improved task-based evaluation method of summarization, the accuracy of which is increased by specifying the details of the task including background stories, and by assigning ten subjects per summary sample. The method also serves precision/recall pairs for a variety of situations by introducing multiple levels of relevance assessment. The method is applied to prove phrase-represented summary is most effective to select relevant documents from information retrieval results.
StreamShield: a stream-centric approach towards security and privacy in data stream environments
Authors: Rimma V. Nehme, Hyo-Sang Lim, Elisa Bertino, Elke A. Rundensteiner
Venue: Proceedings of the 35th SIGMOD international conference on Management of data (2009)

We propose to demonstrate the StreamShield, a system designed to address the problem of security and privacy in the context of Data Stream Management Systems (DSMSs). In StreamShield, continuous access control is enforced by taking a novel "stream-centric" approach towards security. Security policies are not persistently stored on the server, but rather are depicted by security metadata, called "security punctuations", and get embedded into streams together with the data. We distinguish between two types of security punctuations: (1) the "data security punctuations" (dsps) describing the data-side security policies, and (2) the "query security punctuations" (qsps) representing the query-side security policies. The advantages of such stream-centric security model include flexibility, dynamicity and speed of enforcement. Furthermore, DSMSs can adapt to not only data-related but also to security-related selectivities, which helps reduce the waste of resources, when few subjects have access to streaming data.