ppxscal/embedding_network huggingface dataset:
Complexity and composition of synthesized web services
Authors: Wenfei Fan, Floris Geerts, Wouter Gelade, Frank Neven, Antonella Poggi
Venue: Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems (2008)

The paper investigates fundamental decision problems and composition synthesis for Web services commonly found in practice. We propose a notion of synthesized Web services (ASTs) to specify the behaviors of the services. Upon receiving a sequence of input messages, an AST issues multiple queries to a database and generates actions, in parallel; it produces external messages and database updates by synthesizing the actions parallelly generated. In contrast to previous models for Web services, ASTs advocate parallel processing and (deterministic) synthesis of actions. We classify ASTs based on what queries an AST can issue, how the synthesis of actions is expressed, and whether unbounded input sequences are allowed in a single interaction session. We show that the behaviors of Web services supported by various prior models, data-driven or not, can be specified by different AST classes. For each of these classes we study the non-emptiness, validation and equivalence problems, and establish matching upper and lower bounds on these problems. We also provide complexity bounds on composition synthesis for these AST classes, identifying decidable cases.
Figurative Privacy Control of SIP-Based Narrowcasting
Authors: Mohammad Sabbir Alam, Michael Cohen, Ashir Ahmed, Julian Villegas
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications (2008)

In traditional conferencing systems, participants have little or no privacy, as their voices are by default shared with all others in a session. Such systems cannot offer participants the options of muting and deafening other members. The concept of narrowcasting can be applied to make these kinds of filters available in multimedia conferencing systems. Our system treats media sinks (in the simplest case, listeners) as full citizens, peers of the media sources (conversants’ voices), and we defined therefore duals of mute & select : deafen & attend, which respectively block a sink or focus on it to the exclusion of others. In this article, we describe our prototyped system, which uses existing standard Session Initiation Protocol (SIP) methods to control fine-grained narrowcasting sessions. The design considers the policy configured by the participants and provides a policy evaluation algorithm for media mixing and delivery. We have integrated a “virtual reality”-style interface with this SIP backend to display and control articulated narrowcasting with figurative avatars.
Search Engines' Help Systems
Authors: Yun-Ke Chang, Miguel A. Morales Arroyo, Amanda Spink, Myat Thu Aung, Kyaw Thu, Ya Lwin, Zaw Win Htike
Venue: Proceedings of the Fifth International Conference on Information Technology: New Generations (2008)

The HELP information provided by search engines can facilitate its user’s information seeking process or hinder it. This study analyzed 20 search engines on how their HELP Systems are placed and organized. Help systems are separated into pre-search help system, and post-search help system, and six aspects of help systems were investigated, including navigation, design elements, technical help, conceptual help, terminological, and strategic aspects. A general taxonomy of existing help systems of search engines is provided as the result. The proposed taxonomy may be used as the framework to develop questionnaire for further study in stereotyping search engine users.
Morphological Changes of Mesenchymal Stem Cells by Cyclic Stretch
Authors: Samane Ghazanfari, Mohammad Tafazzoli-Shadpour, Mohammad Ali Shokrgozar, Naser Amirizadeh, Esmael Jafargholi Rangraz
Venue: Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics - Volume 01 (2008)

Bone marrow mesenchymal stem cells (MSCs) are capable of self-renewal and can differentiate into multiple non-hematopoietic cell lineages such as smooth muscle cells (SMCs). Mechanical stimulations are critical to morphological changes, development, regeneration, and pathology of mesenchymal tissues. The type of mechanical stimulation applied on the cells is important for the induced cell response and function. To study effects of mechanical load on morphology of stem cells, cyclic strain is applied on cultured cells by use of a designed stretch device capable of operation inside an incubator. Effects of mechanical loading on MSCs morphology are quantified using image processing methods. The tests are performed for 5-15% load amplitudes with 1Hz frequency and 1-8 hour durations. Fractal and topological parameters of cellular images before and after tests are calculated by development of an image processing code. Results demonstrate statistically significant changes in cell morphology and topology due to mechanical stretch. By elevation of load amplitude, fractal dimension decreases and orientation angle increases due to alignment of cells. It is concluded that tensile loading of MSCs influences cell morphology and alignment a mechanism for functional adaptation, structural regulation and differentiation.
Improving Training Speed of Support Vector Machines by Creating Exploitable Trends of Lagrangian Variables: An Application to DNA Splice Site Detection
Authors: Jason Li, Saman K. Halgamuge
Venue: Proceedings of the 2007 Frontiers in the Convergence of Bioscience and Information Technologies (2007)

Support Vector Machines are state-of-the-art machine learning algorithms that can be used for classification problems such as DNA splice site identification. However, the large number of samples in biological data sets can often lead to slow training speed. The training speed can be improved by removing non-support vectors prior to training. This paper proposes a method to predict non-support vectors with high accuracy by the use of strict-constrained gradient ascent optimisation. Unlike other data pre-selection methods, the proposed gradient based method is itself a training algorithm for SVM, and is also very simple to implement. Experiments with comparable results are conducted on a DNA splice-site detection problem. Results show significant speed improvements over other algorithms. The relationship between speed improvement and cache memory size is also exploited. Generalisation capability of the proposed algorithm is also shown to be better than some other reformulated SVMs.
A New Modeling for Finding Optimal Weighted Distances
Authors: Yam Ki Cheung, Ovidiu Daescu, Anastasia Kurdia
Venue: Proceedings of the 2008 International Conference on Biocomputation, Bioinformatics, and Biomedical Technologies (2008)

We prove that each optimization problem associated with finding an optimal straight line distance between two regions of a weighted planar subdivision can be restated as a two-dimensional sum of linear fractionals problem over an arc of the unit circle. Compared to previous results, that involved more general functions over two dimensional domains, our solution has potential for order of magnitude speedups. The problem has a few bio-medical applications, including optimal treatment planning in intensity modulated radiation therapy and brachytherapy.
Portable library development for reconfigurable computing systems: A case study
Authors: Proshanta Saha, Esam El-Araby, Miaoqing Huang, Mohamed Taher, Sergio Lopez-Buedo, Tarek El-Ghazawi, Chang Shu, Kris Gaj, Alan Michalski, Duncan Buell
Venue: Parallel Computing (2008)

Portable libraries of highly-optimized hardware cores can significantly reduce the development time of reconfigurable computing applications. This paper presents the tradeoffs and challenges in the design of such libraries. A set of library development guidelines is provided, which has been validated with the RCLib case study. RCLib is a set of portable libraries with over 100 cores, targeting a wide range of applications. RCLib portability has been verified in three major High-Performance reconfigurable computing architectures: SRC6, Cray XD1 and SGI RC100. Compared to full-software implementations, applications using RCLib hardware acceleration cores show speedups ranging from one to four orders of magnitude.
Software-based distortion compensation for a scanned beam display
Authors: Miao Liao, Zhengyou Zhang, John Lewis
Venue: Proceedings of the 5th ACM/IEEE International Workshop on Projector camera systems (2008)

We developed a software-based approach to compensate for distortion in a scanned beam display (SBD) system. A scanned beam display has advantages of being small in device size, low in energy consumption, and capable of producing high-resolution and variable images. However, it suffers from two main problems: the non-uniform power spreading within a single light spot and the non-uniform light spot distribution in trajectory. While most work has been done to solve these problems from the hardware design perspective, we address these issues by minimizing the difference between input and output images on a software level. We also implemented our algorithm on Graphics Processing Unit (GPU) to achieve near real-time performance which is required by video display. Finally, the output light source control value is applied to a scanned beam display simulator, showing improved display images.
On combination of first order Strang's splitting and additive splitting for the solution of multi-dimensional convection diffusion problem
Authors: Daoud S. Daoud
Venue: International Journal of Computer Mathematics (2007)

In this article we present a new splitting approach for the numerical solution of the multi-dimensional convection diffusion equations. The method combines additive and multiplicative splitting. In particular the method combines first order Strang's splitting, multiplicative splitting defined for splitting the convection and diffusion equation, and additive splitting defined in accordance with the spatial variables. The method not only reduces the linear (or nonlinear) original problem into a series of one-dimensional and one physical operator linear problems, but also enables us to compute these one-dimensional problems using parallel processors. The accuracy and stability of the new algorithm are investigated through the solution of different multi-dimensional convection diffusion model problems with scalar coefficients.
Epidemic Modeling of Military Networks Using Group and Entity Mobility Models
Authors: Temitayo Olajide, Alicia Nicki Washington
Venue: Proceedings of the Fifth International Conference on Information Technology: New Generations (2008)

Current work in the area of disruption-tolerant networks (DTN) focuses on various forms of epidemic routing, similar to mathematical epidemiology. In as much as this research has pioneered the field, it has left a large amount of open areas of research. Particularly, the assumptions made and subsequent results fall short of real-world scenarios where DTN would be deployed. In this preliminary work, we investigate the fundamental performance differences and limitations of DTN employing entity and group mobility models. Specifically, we compare the performance of the random waypoint entity mobility model with the nomadic group mobility model.
Solving functional reliability issue for an optical electrostatic switch
Authors: H. Camon, C. Ganibal, N. Rapahoz, M. Trzmiel, C. Pisella, C. Martinez, S. Valette
Venue: Microsystem Technologies (2008)

In this paper, we report the advantage of using AC actuating signal for driving micro electro mechanical systems actuators instead of DC voltages. The study is based upon micro mirror devices used in digital mode for optical switching operation. When the pull-in effect is used, charge injection occurs when the micro mirror is maintained in the deflected position. To avoid this effect, a geometrical solution is to realize grounded landing electrodes which are electro-statically separated from the control electrodes. Another solution is the use of AC signal which eliminates charge injection particularly if a bipolar signal is used. Long-term experiments have demonstrated the reliability of such a signal command to avoid injection of electric charges.
On the Properties of System-Wide Responsive Behavior
Authors: Tsioliaridou Ageliki, Vassilis Tsaoussidis
Venue: Proceedings of the Fifth International Conference on Information Technology: New Generations (2008)

High contention of flows is associated with unstable network behavior and unmanageable resource administration, i.e., convergence to equilibrium becomes a difficult task. In this paper, we propose a new approach to control congestion. In this context, we present an algorithm for active queue management, to notify simultaneously all competing flows about incipient congestion. Typically, AQM schemes notify only a small portion of participating flows about congestion events. Our notification scheme, called Global Notifier (GN), allows for an immediate and less aggressive adjustment of transmission windows with three consequent properties: (i) fairness is improved, (ii) smoothness of responsive flows is improved and (iii) system utilization is better regulated between the knee and the cliff. We detail our algorithm and the corresponding responsive behavior of participating flows, and we highlight significant performance results gathered by simulations.
In search of `architectural knowledge'
Authors: Remco C. de Boer, Rik Farenhorst
Venue: Proceedings of the 3rd international workshop on Sharing and reusing architectural knowledge (2008)

The software architecture community puts more and more emphasis on 'architectural knowledge'. However, there appears to be no commonly accepted definition of what architectural knowledge entails, which makes it a fuzzy concept. In order to obtain a better understanding of how different authors view 'architectural knowledge', we have conducted a systematic review to examine how architectural knowledge is defined and how the different definitions in use are related. From this review it became clear that many authors do not provide a concrete definition of what they think architectural knowledge entails. What is more intriguing, though, is that those who do give a definition seem to agree that architectural knowledge spans from problem domain through decision making to solution; an agreement that is not obvious from the definitions themselves, but which is only brought to light after careful systematic comparison of the different studies.
Procedural Urban Modeling in Practice
Authors: Benjamin Watson, Pascal Müller, Oleg Veryovka, Andy Fuller, Peter Wonka, Chris Sexton
Venue: IEEE Computer Graphics and Applications (2008)

Film and game studios can no longer meet audience demand for visual content by increasing production budgets. Instead they are turning to procedural modeling, particularly for modeling cities. The authors review procedural modeling, examine the CityEngine tool, and study the use of procedural urban modeling in Electronic Arts' Need for Speed games.
Outcomes of neural and rule-based classifiers as criterion in bi-objective evolutionary optimization of feature space in pattern recognition
Authors: Krzysztof A. Cyran
Venue: Proceedings of the 5th WSEAS International Conference on Computational Intelligence, Man-Machine Systems and Cybernetics (2006)

Neural networks are widely used as classifiers in many pattern recognition problems because of good generalization abilities, what is a crucial issue in any practical application. However, vast majority of neural network architectures demands a huge computational effort for the training process, what in turn limits such solutions from application in one important domain of pattern recognition, which is the optimization of feature extractors. The optimization requires iterative computation of the objective function, and therefore such computation should be univocal and computationally effective. The paper presents how these postulates are satisfied in a special neural architecture called probabilistic neural network, which can therefore be effectively used for calculation of criterion in an evolutionary optimization of the feature space. As the experimental verification of proposed methodology, the optimization of Fraunhofer diffraction based pattern recognition system is presented, and compared with alternative solution, i.e. application of the rule-based classifier outcomes in the same role. The optimized system is a class of hybrid, fast, opto-electronic image recognizers, and the paper presents the use of it in the recognition of three different domains of images: recognition of the type of the vehicles, recognition of the type of the road obstacle in infrared wavelength, and the recognition of the class of the subsurface stress in the optical fiber. The experimentally obtained results confirm, that probabilistic neural network based main criterion used in a bi-criterion evolutionary optimization, outperforms the rough set based criterion in the mentioned systems.
Service Discovery and Negotiation With COWS
Authors: Alessandro Lapadula, Rosario Pugliese, Francesco Tiezzi
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2008)

To provide formal foundations to current (web) services technologies, we put forward using COWS, a process calculus for specifying, combining and analysing services, as a uniform formalism for modelling all the relevant phases of the life cycle of service-oriented applications, such as publication, discovery, negotiation, deployment and execution. In this paper, we show that constraints and operations on them can be smoothly incorporated in COWS, and propose a disciplined way to model multisets of constraints and to manipulate them through appropriate interaction protocols. Therefore, we demonstrate that also QoS requirement specifications and SLA achievements, and the phases of dynamic service discovery and negotiation can be comfortably modelled in COWS. We illustrate our approach through a scenario for a service-based web hosting provider.
Concurrent Testing of Java Components Using Java PathFinder
Authors: Vadim Mutilin
Venue: Proceedings of the Second International Symposium on Leveraging Applications of Formal Methods, Verification and Validation (2006)

Concurrent systems work nondeterministically. For with different parameters in different states, but it does not guarantee that all possible execution paths of a method will be tested because of its concurrent nature. This paper presents an integration method that combines the testing techniques with model checking techniques of Java PathFinder (JPF). The method guarantees that all possible execution paths needed for checking the correctness of the system are explored. The method is based on localization of the search performed by JPF. It reduces the state space while preserving the advantages of UniTESK like state abstraction and automatic checking of correctness. Moreover, it allows to use the same test suite without modification with JPF.
30th European Conference in Information Retrieval (ECIR 2008)
Authors: Iadh Ounis, Ian Ruthven, Vassilis Plachouras
Venue: ACM SIGIR Forum (2008)

The 30th European Conference on Information Retrieval Research (ECIR '08) took place in Glasgow, Scotland, on 30th March -- 3rd April, 2008 and was organised by the Department of Computing Science, University of Glasgow.
Publication and Protection of Sensitive Site Information in a Grid Infrastructure
Authors: Shreyas Cholia, R. Jefferson Porter
Venue: Proceedings of the 2008 Eighth IEEE International Symposium on Cluster Computing and the Grid (2008)

In order to create a successful grid infrastructure, sites and resource providers must be able to publish information about their underlying resources and services. This information makes it easier for users and virtual organizations to make intelligent decisions about resource selection and scheduling, and can be used by the grid infrastructure for accounting and troubleshooting services. However, such an outbound stream may include data deemed sensitive by a resource-providing site, exposing potential security vulnerabilities or private user information to the world at large, including malicious entities. This study analyzes the various vectors of information being published from sites to grid infrastructures. In particular, it examines the data being published to, and collected by the Open Science Grid, including resource selection, monitoring, accounting, troubleshooting, logging and site verification data. We analyze the risks and potential threat models posed by the publication and collection of such data. We also offer some recommendations and best practices for sites and grid infrastructures to manage and protect sensitive data.
A leak and its remedy in JPEG image encryption
Authors: Weihai Li, Yuan Yuan
Venue: International Journal of Computer Mathematics (2007)

Focusing on the encryption of digital image and video, an intrinsic weakness of all existing discrete-cosine-transform (DCT) based algorithms is reported. This serious weakness of DCT-based encryptions is analysed theoretically and then demonstrated practically. As an instance, a novel attack algorithm is proposed to acquire the sketch information from encrypted data without any prior knowledge of the encryption algorithm. The quality of the extracted sketch is then evaluated by comparing with the original picture edge. Thereafter, to prevent this kind of attack, a full inter-block shuffle (FIBS) approach is proposed. This method can be employed to improve the encryption security in all DCT-based algorithms, such as JPEG, MPEG video and H.26x video.
An application service provider for finite element analysis
Authors: Marco L. Bittencourt, Edilson G. Borges, Eduardo F. Carvalho, Rodrigo A. Augusto
Venue: Advances in Engineering Software (2008)

This paper presents an application service provider (ASP) for finite element analysis. The basic web infrastructure has been implemented in PHP, Javascript and MySQL. Simulation services based on forms for mesh generation and ANSYS processing are presented. The main features of a pre-processing software based on the components Qt, ACIS and HOOPS are also discussed.
Exploiting subjectivity analysis in blogs to improve political leaning categorization
Authors: Maojin Jiang, Shlomo Argamon
Venue: Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval (2008)

In this paper, we address a relatively new and interesting text categorization problem: classify a political blog as either liberal or conservative, based on its political leaning. Our subjectivity analysis based method is twofold: 1) we identify subjective sentences that contain at least two strong subjective clues based on the General Inquirer dictionary; 2) from subjective sentences identified, we extract opinion expressions and other features to build political leaning classifiers. Experimental results with a political blog corpus we built show that by using features from subjective sentences can significantly improve the classification performance. In addition, by extracting opinion expressions from subjective sentences, we are able to reveal opinions that are characteristic of a specific political leaning to some extent.