ppxscal/embedding_network huggingface dataset:
A service-oriented middleware for context-aware applications
Authors: Luiz Olavo Bonino da Silva Santos, Remco Poortinga van Wijnen, Peter Vink
Venue: Proceedings of the 5th international workshop on Middleware for pervasive and ad-hoc computing: held at the ACM/IFIP/USENIX 8th International Middleware Conference (2007)

Context awareness has emerged as an important element in distributed computing. It offers mechanisms that allow applications to be aware of their environment and enable these applications to adjust their behavior to the current context. Considering the dynamic nature of context, the data flow of relevant contextual information can be significant. In order to keep track of this information flow, a flexible service mechanism should be available for the client applications. In this document we present a service-oriented middleware for context-aware applications. This middleware provides support to leverage the development of context-aware applications by providing a scripting-like approach for context-aware application development; allowing the subscription of rules containing context-based events and conditions and a notification to be sent when the specified context holds. Moreover, a domain-specific language has been developed to express these context-based rules.
Secure information flow for a concurrent language with scheduling
Authors: Gilles Barthe, Leonor Prensa Nieto
Venue: Journal of Computer Security (2007)

Information flow type systems provide an elegant means to enforce confidentiality of programs. Using the proof assistant Isabelle/HOL, we have specified an information flow type system for a concurrent language featuring primitives for scheduling, and shown that typable programs are non-interfering for a possibilistic notion of non-interference. The development, which constitutes to our best knowledge the first machine-checked account of non-interference for a concurrent language, takes advantage of the proof assistant facilities to structure the proofs about different views of the programming language and to identify the relationships among them and the type system. Our language and type system generalize previous work of Boudol and Castellani, Theoretical Computer Science 281 (2002), 109-130, in particular by including arrays and lifting several convenient but unnecessary conditions in the syntax and type system of the work of Boudol and Castellani. We illustrate the generality of our language and the usefulness of our type system with a medium size example.
Automatic segmentation of unorganized noisy point clouds based on the Gaussian map
Authors: Yu Liu, Youlun Xiong
Venue: Computer-Aided Design (2008)

A nonparametric clustering algorithm, called cell mean shift (CMS), is developed to extract clusters of a set of points on the Gaussian sphere S^2. It is computationally more efficient than the traditional mean shift (MS). Based on the singular value decomposition, the dimensional analysis is introduced to classify these clusters into point-, curve-, and area-form clusters. Each cluster is the Gaussian image of a set of points which will be examined by a connected search in R^3. An orientation analysis of the Gaussian map to area-form clusters is applied to identify hyperbolic and elliptical regions. A signed point-to-plane distance function is used to identify points of convex and concave regions. Segmentation results of several real as well as synthetic point clouds, together with complexity analyses, are presented.
New strong convergence theorems for nonexpansive nonself-mappings without boundary conditions
Authors: Yisheng Song
Venue: Computers Mathematics with Applications (2008)

The aim of this work is to establish the strong convergence of explicit viscosity-like methods for a nonexpansive nonself-mapping without boundary conditions defined in a Banach space. This gets rid of the restriction and dependence on the implicit anchor-like continuous path x"t in the existing literature.
A Communication-Time Tradeoff
Authors: C. H. Papadirnitriou
Venue: Proceedings of the 25th Annual Symposium onFoundations of Computer Science, 1984 (1984)

We show a nontrivial tradeoff between the communication c and time t required to compute a collection of values whose dependencies form a grid, i.e., value (i,j) depends on the values (i-1,j) and (i,j-1). No matter how we share the responsibility for computing the nodes of the n x n grid among processors, the law ct = /spl Omega/(n/sup 3/) must hold. Further, there must be a single path through the grid along which there are d communication steps, where dt = /spl Omega/(n/sup 2/). Depending on the machine organization, either law may be the more significant.
Ontology-based service layering for facilitating alternative service discovery
Authors: Meeyeon Lee, Seung Soo Park, Jung-Won Lee
Venue: Proceedings of the 2nd international conference on Ubiquitous information management and communication (2008)

To provide dynamic services for users in a ubiquitous environment, an efficient context-aware service discovery mechanism is essential. Most of current researches are focused on composing services which satisfy pre-defined service specifications, by checking the availability of the devices and finding services that satisfy the user's preference. In this paper, we introduce a process for building a ubiquitous service ontology, and propose the specification to describe each service. With the service ontology, using the concept of service availability, not device availability, our method could discover the most appropriate service, and replace of it if the service requested is unavailable. The experimental result shows that our service ontology for home domain could reduce, on the average, more than 36% of the time required to discover alternative services compare to using just a flat list of services.
P2P Distributed Intrusion Detections by Using Mobile Agents
Authors: Dayong Ye, Quan Bai, Minjie Zhang, Zhen Ye
Venue: Proceedings of the Seventh IEEE/ACIS International Conference on Computer and Information Science (icis 2008) (2008)

Traditional hierarchical intrusion detection systems have a central manager which attracts hackers to attack and might overload when there are too many client requests. To overcome these drawbacks, some researchers suggested to apply Peer-to-Peer approaches in intrusion detection. Most current Peer-to-Peer intrusion detection systems only allow hosts to collect related information from "neighbours" (one hop hosts). The limitation of information sources may lead a system to make inaccurate decisions. In this paper, we propose a Mobile Agent Based Peer-to-Peer Distributed Intrusion Detection Framework. Agents are included in this framework to achieve intrusion detections. In addition, a mobile agent migration strategy is applied in the framework to allow agents not only to collect information from direct-linked "neighbours" but also other hosts in the network. Benefitted from agent and Peer-to-Peer techniques, our framework can decrease the overhead of each host in the network, reduce the security risk, and achieve more accurate detections.
Rational solutions of ordinary difference equations
Authors: Ruyong Feng, Xiao-Shan Gao, Zhenyu Huang
Venue: Journal of Symbolic Computation (2008)

In this paper, we generalize the results of Feng and Gao [Feng, R., Gao, X.S., 2006. A polynomial time algorithm to find rational general solutions of first order autonomous ODEs. J. Symbolic Comput., 41(7), 735-762] to the case of difference equations. We construct two classes of ordinary difference equations (O@DEs) whose solutions are exactly the univariate polynomial and rational functions respectively. On the basis of these O@DEs and the difference characteristic set method, we give a criterion for an O@DE with any order and nonconstant coefficients to have a rational type general solution. For the first-order autonomous (constant coefficient) O@DE, we give a polynomial time algorithm for finding the polynomial solutions and an algorithm for finding the rational solutions for a given degree.
Low Power and Reliable Interconnection with Self-Corrected Green Coding Scheme for Network-on-Chip
Authors: Po-Tsang Huang, Wei-Li Fang, Yin-Ling Wang, Wei Hwang
Venue: Proceedings of the Second ACM/IEEE International Symposium on Networks-on-Chip (2008)

In this paper, a low power joint bus and error correction coding is proposed to provide reliable and energy-efficient interconnection for network-on-chip (NoC) in nano-scale technology. The proposed self-corrected “green” (low power) coding scheme is constructed by two stages, which are triplication error correction coding (ECC) stage and green bus coding stage. Triplication ECC provides a more reliable mechanism to advanced technologies. Moreover, in view of lower latency of decoder, it has rapid correction ability to reduce the physical transfer unit size of switch fabrics by self-corrected technique in bit level. The green bus coding employs more energy reduction by a joint triplication bus power model for crosstalk avoidance. In addition, the circuitry of green bus coding is more simple and effective. Based on UMC 90nm CMOS technology, the simulation results show self-corrected green coding can achieve 34.4% energy reduction with small codec overhead. This approach not only makes the NoC applications tolerant against transient malfunctions, but also realizes energy efficiency.
Beyond keywords: Automated question answering on the web
Authors: Dmitri Roussinov, Weiguo Fan, José Robles-Flores
Venue: Communications of the ACM (2008)

Beyond Google, emerging question-answering systems respond to natural-language queries.
Understanding Self-Organizing Teams in Agile Software Development
Authors: Nils Brede Moe, Torgeir Dingsøyr, Tore Dybå
Venue: Proceedings of the 19th Australian Conference on Software Engineering (2008)

Traditional software teams consist of independently focused self-managing professionals with high individual but low team autonomy. A challenge with introducing agile software development is that it requires a high level of both individual and team autonomy. This paper studies the barriers with introducing self-organizing teams in agile software development and presents data from a seven month ethnographic study of professional developers in a Scrum team. We found the most important barrier to be the highly specialized skills of the developers and the corresponding division of work. In addition we found a lack of system for team support, and reduced external autonomy to be important barriers for introducing self-organizing teams. These findings have implications for software development managers and practitioners.
An experimental laboratory environment for teaching embedded operating systems
Authors: Dennis Brylow
Venue: ACM SIGCSE Bulletin (2008)

This paper describes Marquette University's efforts to build an experimental embedded systems laboratory for hands-on projects in an operating systems course. Our prototype laboratory is now serving as the basis for a coherent sequence of class projects threaded throughout courses in hardware systems, operating systems, networking, and embedded systems. We describe the major components of our Embedded XINU laboratory environment, the operating systems course, and related improvements in other core courses of our curriculum.
Contextual vocabulary acquisition as computational philosophy and as philosophical computation
Authors: William J. Rapaport, Michael W. Kibby
Venue: Journal of Experimental Theoretical Artificial Intelligence (2007)

Contextual vocabulary acquisition (CVA) is the active, deliberate acquisition of a meaning for an unknown word in a text by reasoning from textual clues, prior knowledge, and hypotheses developed from prior encounters with the word, but without external sources of help such as dictionaries or people. Published strategies for CVA vaguely and unhelpfully tell the reader to 'guess'. Artificial intelligence algorithms for CVA can fill in the details that replace 'guessing' by 'computing'; these details can then be converted to a curriculum that can be taught to students to improve their reading comprehension. Such algorithms also suggest a way out of the Chinese Room and show how holistic semantics can withstand certain objections.
Numerical treatment of fractional heat equations
Authors: R. Scherer, S. L. Kalla, L. Boyadjiev, B. Al-Saqabi
Venue: Applied Numerical Mathematics (2008)

This paper is devoted to the numerical treatment of some fractional extensions of the temperature field problem in oil strata. Based on the Grunwald-Letnikov's definition of a fractional derivative, finite difference schemes for the approximation of the solution are discussed. By means of them the fractional heat equation is solved. The main properties of the explicit and implicit numerical methods developed, related to stability, convergence and error behaviour are also studied. Stability conditions as extensions of the CLF condition are derived and numerical experiments are provided.
Development of an integrated look-ahead dynamics-based NURBS interpolator for high precision machinery
Authors: Meng-Shiun Tsai, Hao-Wei Nien, Hong-Tzong Yau
Venue: Computer-Aided Design (2008)

Methodologies for planning motion trajectory of parametric interpolation such as non-uniform rational B-spline (NURBS) curves have been proposed in the past. However, most of the algorithms were developed based on the constraints of feedrate, acceleration/deceleration (acc/dec), jerk, and chord errors. The errors caused by servo dynamics were rarely included in the design process. This paper proposes an integrated look-ahead dynamics-based (ILD) algorithm which considers geometric and servo errors simultaneously. The ILD consists of three different modules: a sharp corner detection module, a jerk-limited module, and a dynamics module. The sharp corner detection module identifies sharp corners of a curve and then divides the curve into small segments. The jerk-limited module plans the feedrate profile of each segment according to the constraints of feedrate, acc/dec, jerk, and chord errors. To ensure that the contour errors are bounded within the specified value, the dynamics module further modifies the feedrate profile based on the derived contour error equation. Simulations and experiments are performed to validate the ILD algorithm. It is shown that the ILD approach improves tracking and contour accuracies significantly compared to adaptive-feedrate and curvature-feedrate algorithms.
Software engineering and formal methods
Authors: Mike Hinchey, Michael Jackson, Patrick Cousot, Byron Cook, Jonathan P. Bowen, Tiziana Margaria
Venue: Communications of the ACM (2008)

The answer to software reliability concerns may lie in formal methods.
A partitioning algorithm for block-diagonal matrices with overlap
Authors: Guy Antoine Atenekeng Kahou, Laura Grigori, Masha Sosonkina
Venue: Parallel Computing (2008)

We present an algorithm for partitioning a sparse matrix into a matrix that has blocks on the diagonal such that two consecutive blocks can overlap. We refer to this form of the matrix as block diagonal matrix with overlap. The partitioned matrix is suitable for applying the explicit formulation of multiplicative Schwarz (EFMS) [G.A. Atenekeng Kahou, E. Kamgnia, B. Philippe, An explicit formulation of the multiplicative Schwarz preconditioner, Journal of Applied Numerical Mathematics 57 (2007) 1197-1213] used as a preconditioner for solving a sparse unsymmetric system of linear equations Ax=b. The proposed algorithm partitions the graph of the matrix A into k parts such that every part V"i has connecting edges with at most two neighbors V"i"-"1 and V"i"+"1. First, an ordering algorithm that reduces the profile of the matrix, and an initial block-diagonal partition with overlap is obtained. Second, an iterative strategy is used to further refine the partitioning by allowing vertices to be moved between partitions. Experiments performed on real-world matrices show the usefulness of this approach.
Modeling and Automated Containment of Worms
Authors: Sarah H. Sellke, Ness B. Shroff, Saurabh Bagchi
Venue: IEEE Transactions on Dependable and Secure Computing (2008)

Self-propagating codes, called worms, such as Code Red, Nimda, and Slammer, have drawn significant attention due to their enormously adverse impact on the Internet. Thus, there is great interest in the research community in modeling the spread of worms and in providing adequate defense mechanisms against them. In this paper, we present a (stochastic) branching process model for characterizing the propagation of Internet worms. The model is developed for uniform scanning worms and then extended to preference scanning worms. This model leads to the development of an automatic worm containment strategy that prevents the spread of a worm beyond its early stage. Specifically, for uniform scanning worms, we are able to (1) provide a precise condition that determines whether the worm spread will eventually stop and (2) obtain the distribution of the total number of hosts that the worm infects. We then extend our results to contain preference scanning worms. Our strategy is based on limiting the number of scans to dark-address space. The limiting value is determined by our analysis. Our automatic worm containment scheme effectively contains both uniform scanning worms and local preference scanning worms, and it is validated through simulations and real trace data to be non-intrusive. We also show how to incrementally deploy our worm containment strategy.
Stochastic simulation studies of molecular resists for the 32nm technology node
Authors: D. Drygiannakis, G. P. Patsis, N. Tsikrikas, G. Kokkoris, A. Boudouvis, I. Raptis, E. Gogolides, P. Argitis
Venue: Microelectronic Engineering (2008)

Experiments and simulations suggest that low-molecular-weight resist materials could result in low line-edge roughness (LER) which is a critical parameter for the forthcoming technology nodes. Two positive molecular resist architectures are modeled with a stochastic lithography simulator and their LER behavior is quantified. The corresponding LER values obtained are less than 1nm, suggesting that such materials are promising for the fabrication of devices even down to the 32nm node. Two-dimensional lattices with the molecular resist architectures are created and combined with the stochastic lithography simulator and a simple etching modeling algorithm, in order to test the transferred line-width roughness (LWR) on the gate region of the pMOS and nMOS transistors of an inverter cell designed with 40nm nominal gate length. The role of the molecular resist architecture on the final LWR of transistor gate is discussed.
A Distributed Algorithm for Finding a Tree Trunk and its Application for Multicast in Mobile Ad Hoc Networks
Authors: Yamin Li, Shietung Peng, Wanming Chu
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications (2008)

Overlay multicast protocol constructs a virtual mesh spanning all member nodes of a multicast group and employs standard unicast routing to fulfill multicast functionality on application layer. The advantages of this approach are simplicity and flexibility. However, efficiency and stability are the issues that must be addressed as the size of the multicast group grows in the mobile ad hoc networks (MANETs). In this paper, we propose tree trunk for overlay multicast to solve these problems in MANETs. A tree trunk is a path that minimizes the sum of the distances of all vertices to the path plus the length of the path. We give an efficient distributed algorithm for finding a tree trunk in a tree network. We also perform some empirical analysis based on the tree trunk and compare the results with those using spanning tree.
Bi-decomposing large Boolean functions via interpolation and satisfiability solving
Authors: Ruei-Rung Lee, Jie-Hong R. Jiang, Wei-Lun Hung
Venue: Proceedings of the 45th annual Design Automation Conference (2008)

Boolean function bi-decomposition is a fundamental operation in logic synthesis. A function f(X) is bi-decomposable under a variable partition XA,XB,XC on X if it can be written as h(fA(XA,XC),fB(XB, XC)) for some functions h, fA, and fB. The quality of a bi-decomposition is mainly determined by its variable partition. A preferred decomposition is disjoint, i.e. XC = &oslash;, and balanced, i.e. |XA| &atilde; |XB|. Finding such a good decomposition reduces communication and circuit complexity, and yields simple physical design solutions. Prior BDD-based methods may not be scalable to decompose large functions due to the memory explosion problem. Also as decomposability is checked under a fixed variable partition, searching a good or feasible partition may run through costly enumeration that requires separate and independent decomposability checkings. This paper proposes a solution to these difficulties using interpolation and incremental SAT solving. Preliminary experimental results show that the capacity of bi-decomposition can be scaled up substantially to handle large designs.
From conceptual models to schemata: An object-process-based data warehouse construction method
Authors: Dov Dori, Roman Feldman, Arnon Sturm
Venue: Information Systems (2008)

Data warehouse modeling is a complex task, which involves knowledge of business processes of the domain of discourse, understanding the structural and behavioral system's conceptual model, and familiarity with data warehouse technologies. The suitability of current data warehouse modeling methods for large-scale systems is questionable, as they require multiple manual actions to discover measures and relevant dimensional entities and they tend to disregard the system's dynamic aspects. We present an Object-process-based Data Warehouse Construction (ODWC) method that overcomes these limitations of existing methods by utilizing the operational system conceptual model to construct a corresponding data warehouse schema. We specify the ODWC method, apply it on a case study, evaluate it, and compare it to existing methods.
Web application security in a crossing boundaries grid system
Authors: Serena Pastore
Venue: Proceedings of the 2007 Euro American conference on Telematics and information systems (2007)

The grid problem is how to enable coordinated resources sharing and problem solving in dynamic, multi-institutional cross organizations called Virtual Organizations (VOs) that collect a large number of nodes grouped into grid sites. An overlay of policies governs access within a collaboration that is granted to users by a VO and by a site to VOs, nodes and users through site admission-control policies. Most resources consist of web applications and web services shared by a site that is part of a VO. The paper proposes an analysis of web application security by referring to XML-based applications accessed through a grid system. The different organizational domains involved transfer security from grid-wide to the VO level, and from the site and machine to the application level in order to allow local control to be retained.
Problem partitioning in hybrid genetic algorithms
Authors: Philip Little, Bart Rylander
Venue: Proceedings of the 5th WSEAS International Conference on Circuits, Systems, Electronics, Control & Signal Processing (2006)

Genetic algorithms are well suited to hybridization. Problem division between components of the hybrid varies by problem type and by the mechanisms included in the hybrid. We propose a hybridization technique for combining genetic algorithms (GAs) and deterministic algorithms based on solution candidate partitioning. We conduct a set of experiments to evaluate several instances of this hybridization scheme and demonstrate the efficiency of this hybridization within certain partition ranges for these problems. These results indicate that performance of this hybrid approach is superior to a GA or a deterministic algorithm alone for the problem instances examined, a result that may hold for problems of the same classes as those examined. Finally, we propose topics for future research.