ppxscal/embedding_network huggingface dataset:
A Web service discovery algorithm based on dynamic composition
Authors: Fu zhi Zhang, Yan Wang, Lin Wang
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 02 (2007)

The growing number of Web services has greatly placed pressure on discovering Web services. It is a very desiderate to solve the problem how we can discover Web services accurately. The paper proposes a method based on service composition by describing Web services with OWL-S. We firstly analyzed the process model of the service. Then, we make matchmaking and return the result to the requester. Compared with the algorithms based on service profile, it has made use of the process model and taken the composition and repeating execution of Web services into consideration, which can discover the services accurately .The effectiveness of the algorithm is proved by us with experiment.
Irreducible Decompositions of Transformation Graphs by Assignment Techniques
Authors: C. M. Ablow, M. Yoeli, J. Turner
Venue: IEEE Transactions on Computers (1968)

Abstract Autonomous sequential networks are represented by transformation graphs, i.e., finite directed graphs, each vertex of which has outdegree one. A network that can be realized by a set of simpler, parallel networks corresponds to a transformation graph representable as a Cartesian product of simpler graphs. An algorithm for obtaining the various decompositions of a given transformation graph into irreducible factors is presented. The particular decomposition into a minimum number of factors is directly reached by the method. Decompositions into a greater number of factors are also obtained so that a balance may be struck between number and complexity of factors.
Speeding up Fractal Image Compression Based on Local Extreme Points
Authors: Jinshu Han
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 03 (2007)

In fractal image compression, the encoding step is computationally expensive and consumes longer time, which limits the workable applications of fractal image compression. Combining with the characteristics of fractal image encoding, this paper presents an improved image blocks classification method to speed up the encoding process. The classification features are the number and the positions of the local extreme points in row direction in an image block, and a three layers tree classifier which provides a stepwise precise classification is utilized. The comparative experiments results show the validity of presented approach in accelerating fractal encoding process and holding the quality of the reconstructed image, and show the presented approach with simple principle can classify the image blocks more accurately.
LORES-2: A Logic Reorganization System
Authors: Kiyoshi Enomoto, Shunichiro Nakamura, Takuji Ogihara, Shinichi Murai
Venue: IEEE Design Test (1985)

LORES-2 is a logic reorganization system which greatly contributes to the effective automation of logic design. LORES-2 usesa macro-expansion technique to help designers transform printed-circuit assembly logic composed of SSI and MSI circuits intomaster-slice LSI logic circuits. The number of gates of the most reorganized LSI circuit falls within ? 20 percent of thenumber of gates of the original circuit. When ROMS and/or PLAs are not-allowed on the target LSI circuit, those elements areconverted into optimized, multilevel random logic using logic minimization, factoring and macro-expansion techniques.
An Algorithm to Dualize a Regular Switching Function
Authors: P. L. Hammer
Venue: IEEE Transactions on Computers (1979)

Given a monotone (nondecreasing) switching function F(x1,···,xn), its prime implicants are the minimal infeasible points, i.e., the minimal solutions to F(x) = 1. A monotone F is regular ifany "right shift" of a feasible point is again feasible. The roofs of a regular function F are those prime implicants al ofwhose right shifts are feasible. The set of these roofs completely
Software management based on mobile agents
Authors: Maamoun Bernichi, Fabrice Mourlin
Venue: Proceedings of the Second International Conference on Systems and Networks Communications (2007)

there is a need for better management of company's software. It means global access control and hierarchical version control for all the software, used in a project environment. This management involves control of the software reuse even if it is free access software. The directives, we present in this document are designed to set traceability of used software from the project creation until its last evolution. Because this kind of information belongs to the project itself, it has to be saved closely to the core data of the project. A software management directive improves the quality of the project and insures a better maintainability. Our management system is based on mobile agent system. The agents observe the use and context of any software. Such mobile agent system is able to create reports about the activities of the software but also, the agent collect data, which will be the basis of a software map of the company. It will also increase the opportunity for software reuse and consequent productivity improvements.
Bloom histogram: path selectivity estimation for XML data with updates
Authors: Wei Wang, Haifeng Jiang, Hongjun Lu, Jeffrey Xu Yu
Venue: Proceedings of the Thirtieth international conference on Very large data bases - Volume 30 (2004)

Cost-based XML query optimization calls for accurate estimation of the selectivity of path expressions. Some other interactive and internet applications can also benefit from such estimations. While there are a number of estimation techniques proposed in the literature, almost none of them has any guarantee on the estimation accuracy within a given space limit. In addition, most of them assume that the XML data are more or less static, i.e., with few updates. In this paper, we present a framework for XML path selectivity estimation in a dynamic context. Specifically, we propose a novel data structure, bloom histogram, to approximate XML path frequency distribution within a small space budget and to estimate the path selectivity accurately with the bloom histogram. We obtain the upper bound of its estimation error and discuss the trade-offs between the accuracy and the space limit. To support updates of bloom histograms efficiently when underlying XML data change, a dynamic summary layer is used to keep exact or more detailed XML path information. We demonstrate through our extensive experiments that the new solution can achieve significantly higher accuracy with an even smaller space than the previous methods in both static and dynamic environments.
Scientific content creation for web-based education
Authors: Ratan Kumar
Venue: Proceedings of the sixth conference on IASTED International Conference Web-Based Education - Volume 2 (2007)

The web is here and here to stay. A majority of the educational community uses this powerful medium for information dissemination. This paper describes a software tool (USolver) that helps technical educators and trainers to rapidly create and deploy dynamic and interactive web pages, for web-based education. Live analytical content, such as on-line computation and dynamic plotting, are examples of features that may be vital for several technical educators, but is difficult to create. As a result, several authors of the scientific/engineering web pages have to take help of programmers, or learn tedious scripts/programming language or perhaps just post static web pages. USolver allows analytical contents like interactive calculations, interactive plotting, and dynamic unit conversions to be easily created and incorporated in web pages. This empowers the subject matter expert, who plays the key role in creating input for web-based topics or courses. The skills required are similar to those needed for word processing and spreadsheet analysis. The web page design process is visually driven. Web-based interactivity is afforded by incorporating form elements like text-boxes, radio buttons, check boxes, drop-down lists and command button.
An Efficient Multimodal 2D-3D Hybrid Approach to Automatic Face Recognition
Authors: Ajmal Mian, Mohammed Bennamoun, Robyn Owens
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2007)

We present a fully automatic face recognition algorithm and demonstrate its performance on the FRGC v2.0 data. Our algorithm is multimodal (2D and 3D) and performs hybrid (feature-based and holistic) matching in order to achieve efficiency and robustness to facial expressions. The pose of a 3D face along with its texture is automatically corrected using a novel approach based on a single automatically detected point and the Hotelling transform. A novel 3D Spherical Face Representation (SFR) is used in conjunction with the SIFT descriptor to form a rejection classifier which quickly eliminates a large number of candidate faces at an early stage for efficient recognition in case of large galleries. The remaining faces are then verified using a novel region-based matching approach which is robust to facial expressions. This approach automatically segments the eyes-forehead and the nose regions, which are relatively less sensitive to expressions, and matches them separately using a modified ICP algorithm. The results of all the matching engines are fused at the metric level to achieve higher accuracy. We use the FRGC benchmark to compare our results to other algorithms which used the same database. Our multimodal hybrid algorithm performed better than others by achieving 99.74% and 98.31% verification rates at 0.001 FAR and identification rates of 99.02% and 95.37% for probes with neutral and non-neutral expression respectively.
Implicit User Modelling for Query Optimization
Authors: Pavel Kromer, Vaclav Snasel, Jan Platos, Suhail S. J. Owais
Venue: Proceedings of the 18th International Conference on Database and Expert Systems Applications (2007)

The requirements imposed on information retrieval systems are increasing steadily. The vast number of documents in today's large databases and especially on World Wide Web causes notable problems when searching for concrete information. It is difficult to find satisfactory information that accurately matches user information needs even if it is present in the database. One of the key elements when searching the web is proper formulation of user queries. Search effectiveness can be seen as the accuracy of matching user information needs against the retrieved information. Personalized search applications can notably contribute to the improvement of web search effectiveness. It has been shown, that genetic programming can evolve search queries towards users interests captured by the means of relevance. In this paper, we propose user modelling technique based on relevance estimation and provide experimental results in web search framework with evolutionary query optimization.
Design flexibility in seamless coded pattern for localization
Authors: Atsushi Hiyama, Shigeru Saito, Tomohiro Tanikawa, Michitaka Hirose
Venue: Proceedings of the 2007 ACM symposium on Virtual reality software and technology (2007)

Recent development in mobile and ubiquitous computing technology with broadband wireless network has realizing the location based application for mobile and wearable computers. According to the wide spreading number of cellular phone with GPS receiver, it has become easy to provide location based application in outdoor scene. On the contrary, there are several positioning technologies for indoor scene, such using wireless sensors or image processing technology. However, those technologies are still not utilized in daily environment due to the cost inefficiency and the complexity in system setup. Considering the problems in previous positioning system, it is necessary to overcome the following four features to utilize the system in daily scene. &bull; The system is reasonable and easy to setup. &bull; The visual feature of the system must not ruin the design of daily environment. &bull; The system is capable of locating all the users inside the covered environment. &bull; The system is able to extend in wide area such as public space in buildings.
A trusted assessment environment in a network-booted OS
Authors: Giorgio Biacchi, Philip Grew, Elena Pagani
Venue: Proceedings of the sixth conference on IASTED International Conference Web-Based Education - Volume 2 (2007)

This paper describes how a laboratory where students usually access the LAN using personal accounts can be configured during examinations. Test questions are automatically corrected by a learning-management system, which is used to authenticate students (who are further identified by physical presence). During assessment conditions, students must have access only to the URL where the test is located. Access must be denied not only to other websites but also to any notes or materials the students may have stored in their personal space on the LAN. The authors previously implemented such access policies through Microsoft Windows® user-profiling but have now achieved promising results by booting into RAM a customized GNU/Linux operating system over the network.
Discrete Systems and Flowcharts
Authors: U. R. Kodres
Venue: IEEE Transactions on Software Engineering (1978)

This paper points out the abstract similarities between problems arising in programming, discrete systems analysis in engineering, and network flow problems in operations research. The highly developed techniques of analyzing discrete systems of two terminal elements in electrical engineering become applicable to analyzing the complexity and execution time of computer programs.
Predicting Total Hydro Carbons Amount of Air Using Artificial Neural Network
Authors: Saman Sargolzaei, Karim Faez, Arman Sargolzaei
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 03 (2007)

In this article, parameters affecting on formation and elimination of Hydrocarbons using artificial neural network are considered and a model to predict THC (Total Hydrocarbon) amount in air using neural network is earned. Also using neural network model and surveying effect of each parameters on THC amount, optimization of offered model is done. The database to get mentioned model consists 1500 samples of current information in two stations of quality control of TEHRAN city air. Results of using artificial neural network in prediction of THC amount indicate that neural network model is suitable for predicting THC amount. Also to compare improvement of implementing THC prediction model using artificial neural network, a multivariable regression model is used to predict THC amount and its results indicate that MSE is very low when we use artificial neural network.
A comparison of automation techniques for optimization of compressor scheduling
Authors: H. H. Nguyen, V. Uraikul, C. W. Chan, P. Tontiwachwuthikul
Venue: Advances in Engineering Software (2008)

Compressor selection is one of the primary functions in operation of natural gas pipelines, and a major concern of the task is to minimize operating costs. This study presents a comparison of three automation techniques for compressor selection: mixed integer linear programming, genetic algorithms, and expert systems. In compressor selection, dispatchers often turn on/off compressor units based on the status of the pipeline and the anticipated customer demand. Since a novice dispatcher often performs this task on a trial-and-error basis without any guarantee of optimal operations, it is desirable to develop a decision support system that can select compressors based on the available data. This study presents a comparison of three automation techniques for incorporation into a decision support system. Based on parameter values for one section of the gas pipeline at the St. Louis East area in Saskatchewan, Canada, a comparison of the strengths and weaknesses of the three automation techniques as well as the recommendations they gave are discussed.
On Path Cover Problems in Digraphs and Applications to Program Testing
Authors: S. C. Ntafos
Venue: IEEE Transactions on Software Engineering (1979)

In this paper various path cover problems, arising in program testing, are discussed. Dilworth's theorem for acyclic digraphs is generalized. Two methods for fmding a minimum set of paths (minimum path cover) that covers the vertices (or the edges) of a digraph are given. To model interactions among code segments, the notions of required pairs and required paths are introduced. It is shown that rmding a minimum path cover for a set of required pairs is NP-hard. An efficient algorithm is given for findng a minimum path cover for a set of required paths. Other constrained path problems are contsidered and their complexities are discussed.
A Bayesian method for multi-site stochastic data generation: Dealing with non-concurrent and missing data, variable transformation and parameter uncertainty
Authors: Q. J. Wang
Venue: Environmental Modelling Software (2008)

Stochastically generated stream flow and climatic data may be used as input to water resources simulation models for planning purposes. Dealing with non-concurrent and missing data, variable transformation and parameter uncertainty presents a significant challenge in the development of methods for stochastic data generation. In this paper, a Bayesian method is introduced for multi-site stochastic generation of annual stream flow and climatic data. A contemporaneous autoregressive lag-one model CAR(1) with the Box-Cox transformation is used to capture key statistical structure of multiple annual stream flow and climatic time series while keeping the number of model parameters to a minimum. The posterior joint distribution of the model parameters is formulated, allowing for inputs of historical data series that are not continuous or concurrent, thus avoiding the need to infill or truncate data records and maximising the value of available data. Parameter and uncertainty inference are solved numerically by using Markov Chain Monte Carlo simulations. Subsequent stochastic generation of data fully accounts for parameter uncertainty. In addition, a re-parameterization scheme is used to handle the problem of strong inter-parameter dependence from the Box-Cox transformation. The method was applied to the Melbourne Water supply system to demonstrate its computational feasibility.
Evaluation of General-Purpose Construction Simulation and Visualization tools for Modeling and Animating AirSide Airport Operations
Authors: Hiam M. Khoury, Vineet R. Kamat, Photios G. Ioannou
Venue: Simulation (2007)

This paper illustrates how simulation modeling and visualization can be of substantial help in studying airside airport operations, and can greatly contribute in planning and designing construction operations at airports in a way that has the least impact on airside operations. The characteristic that distinguishes the current work is the capability to model and animate airside airport operations with high fidelity using general purpose discrete event simulation and visualization tools typically used to model and animate construction operations. The focus of the presented work is on evaluating the capabilities of state-of-the-art construction simulation and visualization tools in being able to accurately model and animate airside airport operations. The paper presents the simulation model and 3D animation of the airside operations at Detroit Metropolitan Wayne County Airport (DTW) in Romulus, Michigan. It also presents simultaneous modeling and visualization of operations in two different domains (i.e. airside operations and construction). The solution to the problem is described in detail using a simulation model developed in STROBOSCOPE and a 3D animation created using VITASCOPE. The obtained results highlight and prove that general-purpose tools, even if originally designed for specific domains, can be effective in studying operations involving the interaction of entities in multiple domains such as construction and airport operations.
Report on the Third International Workshop on XQuery Implementation, Experience and Perspectives (XIME-P 2006)
Authors: Michael Carey, Torsten Grust
Venue: ACM SIGMOD Record (2007)

On June 30, 2006, XIME-P 2006, the International Workshop on XQuery Implementation, Experience and Perspectives was held. This workshop marks the third event in a workshop series whose primary aim is to shed light on XQuery systems, specification aspects, foundations of the language, and the many perceivable shapes it may take on in the future. Like the two previous workshops of 2004 (Paris) and 2005 (Baltimore), XIME-P 2006 was held as a co-located workshop of the ACM SIGMOD Conference, which this year was held in Chicago, IL, USA. The 2006 edition was co-chaired by Michael Carey and Torsten Grust. The workshop web site can be found at www.ximep-2006.org.
Application of Clustering and Multi-cluster Selection in SoftMan's Perception System
Authors: Aizhong Mi, Xuefeng Zheng, Xuyan Tu
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 02 (2007)

SoftMan, the virtual robot in network environment, is a kind of software Artificial Life living in computer networks. It has a humanoid structure, and simulating human, its perception system should be able to recognize perceptive objects. This paper proposes a cooperative classification model for SoftMan's perception system, in which, different humanoid senses are simulated by multiple classifier systems (MCS). An essential issue in the research of MCS is the method of multiple classifier combination. Accordingly, this paper proposes a method of multiple classifier combination (called CMS), which improves the classification performance by clustering and multi-cluster selection technique. Simulated experiments validate the basic feasibility of the model and the validity of CMS method.
Multi-module vulnerability analysis of web-based applications
Authors: Davide Balzarotti, Marco Cova, Viktoria V. Felmetsger, Giovanni Vigna
Venue: Proceedings of the 14th ACM conference on Computer and communications security (2007)

In recent years, web applications have become tremendously popular, and nowadays they are routinely used in security-critical environments, such as medical, financial, and military systems. As the use of web applications for critical services has increased, the number and sophistication of attacks against these applications have grown as well. Current approaches to securing web applications focus either on detecting and blocking web-based attacks using application-level firewalls, or on using vulnerability analysis techniques to identify security problems before deployment. The vulnerability analysis of web applications is made difficult by a number of factors, such as the use of scripting languages, the structuring of the application logic into separate pages and code modules, and the interaction with back-end databases. So far, approaches to web application vulnerability analysis have focused on single application modules to identify insecure uses of information provided as input to the application. Unfortunately, these approaches are limited in scope, and, therefore, they cannot detect multi-step attacks that exploit the interaction among multiple modules of an application. We have developed a novel vulnerability analysis approach that characterizes both the extended state and the intended workflow of a web application. By doing this, our analysis approach is able to take into account inter-module relationships as well as the interaction of an application's modules with back-end databases. As a result, our vulnerability analysis technique is able to identify sophisticated multi-step attacks against the application's workflow that were not addressed by previous approaches. We implemented our technique in a prototype tool, called MiMoSA, and tested it on several applications, identifying both known and new vulnerabilities.