ppxscal/embedding_network huggingface dataset:
Cooperative Research on Web Data Management at UFMG and UFAM - A Brief Report
Authors: Alberto H. F. Laender, Altigran Soares da Silva
Venue: Proceedings of the 2008 Latin American Web Conference (2008)

The World Wide Web has become a huge repository of data of interest for a variety of application domains. However, the same features that have made the Web so useful and popular also impose important restrictions on the way the data it contains can be manipulated. Particularly, in the traditional Web scenario, there is an inherent difficulty in gaining access to data that is implicitly present in Web pages but is not readily available. The term Web Data Management (WDM) has been used to refer to the study of problems related to fetching, extracting, querying, modeling, storing, transforming, and integrating data available on the Web. These issues have been growing in importance in the scientific community in the last years, as it can be be seen by the considerable space devoted to them in important publication venues. This interest is justified not only by the scientific and technical challenges involved in WDM problems, but also, and specially, by the growing demand from the industry for solving such problems. In this paper, we present a brief report on the WDM cooperative research carried out by the Database Laboratory at the Federal University of Minas Gerais (LBD/UFMG) and the Information Technology Group at the Federal University of Amazonas (GTI/UFAM). The main aim of this research effort is to develop methods and tools for dealing with data available on the Web and in other non-structured sources (e.g., XML documents), thus providing facilities similar to those available in traditional database systems for managing such data.
How does a stochastic optimization/approximation algorithm adapt to a randomly evolving optimum/root with jump Markov sample paths
Authors: G. Yin, C. Ion, V. Krishnamurthy
Venue: Mathematical Programming: Series A and B (2009)

Stochastic optimization/approximation algorithms are widely used to recursively estimate the optimum of a suitable function or its root under noisy observations when this optimum or root is a constant or evolves randomly according to slowly time-varying continuous sample paths. In comparison, this paper analyzes the asymptotic properties of stochastic optimization/approximation algorithms for recursively estimating the optimum or root when it evolves rapidly with nonsmooth (jump-changing) sample paths. The resulting problem falls into the category of regime-switching stochastic approximation algorithms with two-time scales. Motivated by emerging applications in wireless communications, and system identification, we analyze asymptotic behavior of such algorithms. Our analysis assumes that the noisy observations contain a (nonsmooth) jump process modeled by a discrete-time Markov chain whose transition frequency varies much faster than the adaptation rate of the stochastic optimization algorithm. Using stochastic averaging, we prove convergence of the algorithm. Rate of convergence of the algorithm is obtained via bounds on the estimation errors and diffusion approximations. Remarks on improving the convergence rates through iterate averaging, and limit mean dynamics represented by differential inclusions are also presented.
Development tools for bus controller software
Authors: M. I. Thomas
Venue: Proceedings of the May 16-19, 1983, national computer conference (1983)

This paper addresses the problem of software specification and generation for bus controller software. This software is representative of a class of software modules for which the tools may be used. Two tools are described, a simple language in which to specify the module and a program generator that produces code directly from the specifications. The language uses finite state diagram ideas as do many other specification languages, but is constrained so that generation of high-quality code is feasible. A brief outline of the structure of the code generated is given, followed by some indications of the performance of the tools and the experience gained from their use.
Discrete models for production planning under environmental constraints
Authors: Marius Radulescu, Constanta Zoie Radulescu
Venue: Proceedings of the 12th WSEAS international conference on Computers (2008)

The aim of this paper is to develop a discrete multiobjective programming model for production planning that takes into account the trade-off between different and some times conflicting goals as return, financial risk and environmental risk. The model captures the real -life manufacturing situation. Starting from it several single objective models are formulated: a maximum expected return model and a minimum financial risk model. In order to control the pollution several pollution levels are considered and monetary penalties for overcoming them. A numerical example for a textile enterprise is analyzed.
Pander to ponder
Authors: Owen Astrachan
Venue: Proceedings of the 40th ACM technical symposium on Computer science education (2009)

Ponder means "to weigh in the mind with thoroughness and care" [31]. Pander means "to cater to the weaknesses and base desires of others" [31]. We report on a course we have designed and delivered over a six year period. The course was originally designed as a technical writing course for majors, but has evolved into a non-major's version whose enrollment ranks it as one of the three most highly-enrolled and thus arguably most popular courses for undergraduates at our university. We have worked diligently to ensure that students ponder the topics and problems that comprise the material for the course --- and the material is deeply technical at many levels. We have also pandered to student needs in meeting curriculum requirements, offering the course at a time convenient for athletes and others, and using popular media when possible. We started with the goal of engendering interest and passion for computer science and how it affects the world. We report on our efforts to attain this goal while keeping material appropriately technical. We claim our students are engaged in a different type of computational thinking than that espoused in [32, 5, 15]. For the purposes of this paper and discussion we call our approach pander-to-ponder. We provide examples and illustrations of the material we cover, relate it to similar courses at other institutions, and show how we use problems to motivate learning. In the work we report on here the learning is specific to understanding how contributions from computer science are changing the world.
Airspace Capacity Management Based on Control Workload and Coupling Constraints between Airspaces
Authors: Fangqin Liu, Minghua Hu
Venue: Proceedings of the 2009 International Conference on Computer Modeling and Simulation (2009)

Motivated by the need for coordinated multi-Airspace flow management for the National Airspace System because of flux coupling existing in airspaces, we present coupling-capacity of airspace through quantifying the impact of downstream air route flow on upstream flows. First, we present a multi-objective integral optimization model for coupling-capacity of airspace. Secondly, according to the topology structure of airspace, we set up a directed acyclic Graph (DAG). Through the DAG we can analyze the coupling-relationship between airspace sectors. Furthermore, according to the topological inverse sort of the DAG-net, we confirm the order of solving the coupling-capacity of every airspace unit in the airspace system. Finally, we present a hybrid Multi-Objective Genetic Algorithm (MOGA) to solve the multi-objective optimization problem. Simulation results demonstrate that MOGA can approach the satisfying solution about the coupling–capacity model. Through analyzing the solution, the coupling-capacity model of airspace could systemically balance and optimize airspace resources according to the distribution of flow requirements in each airspace element, and eliminate the ripple effect of congestion in the airspace system because of coupling between the airspaces.
Investigating the angular and spectral properties of natural targets using CHRIS-PROBA images of San Rossore test site
Authors: A. Barducci, D. Guzzi, P. Marcoionni, I. Pippi
Venue: International Journal of Remote Sensing (2009)

This paper addresses the use of the bidirectional reflectance distribution function (BRDF) of natural surfaces for remote sensing applications and environmental monitoring. Multiangle images, acquired by the compact high resolution imaging spectrometer (CHRIS) over the San Rossore test site, have been analysed in order to exploit the potential of using the BRDF for data mining and precise retrieval of biophysical and geophysical parameters. The apparent reflectance and the anisotropy factor (ANIF) of selected soil cover types have been computed, after correcting the at-sensor radiance for atmospheric effects. The departure of soil reflectance from the standard Lambertian behaviour has been investigated, together with the hypothesis of BRDF spectral-angular separability. Then, the ANIF dependence on surface optical properties, illumination and viewing geometry has been assessed and demonstrated using an ANIF image. The stability of the atmospheric correction procedure was analysed, studying the retrieved reflectance versus the solar zenith angle.
Solving a vehicle routing problem with time windows by a decomposition technique and a genetic algorithm
Authors: Chi-Bin Cheng, Keng-Pin Wang
Venue: Expert Systems with Applications: An International Journal (2009)

The present study investigates the cost concerns of distribution centers and formulates a vehicle routing problem with time window constraints accordingly. Based on the embedded structure of the original problem, a decomposition technique is employed to decompose the original problems to a clustering problem (main problem) and a set of traveling salesman problems (sub-problems) with time window constraints. This decomposition not only reduces the problem size but also enable the use of simpler solution procedures. A genetic algorithm is developed to solve the clustering problem, while a simple heuristic algorithm is formulated to solve the set of traveling salesman problems. The solution of the original problem is obtained through iterative interactions between the main problem and the set of sub-problems. The performance of the proposed approach is compared with the well-known insertion method and a manual scheduling of a distribution center.
A Novel Dynamic Particle Swarm Optimization Algorithm Based on Chaotic Mutation
Authors: Min Yang, Huixian Huang, Guizhi Xiao
Venue: Proceedings of the 2009 Second International Workshop on Knowledge Discovery and Data Mining (2009)

A novel dynamic particle swarm optimization algorithm based on chaotic mutation (DCPSO) is proposed to solve the problem of the premature and low precision of the common PSO. Combined with linear decreasing inertia weight, a kind of convergence factor is proposed based on the variance of the population’s fitness in order to adjust ability of the local search and global search; The chaotic mutation operator is introduced to enhance the performance of the local search ability and to improve the search precision of the new algorithm. The experimental results show finally that the new algorithm is not only of greater advantage of convergence precision, but also of much faster convergent speed than those of common PSO (CPSO) and linear inertia weight PSO (LPSO).
Research on Secure Key Techniques of Trustworthy Distributed System
Authors: Ming He, Aiqun Hu, Hangping Qiu
Venue: Proceedings of the 2009 International Conference on Computer Engineering and Technology - Volume 01 (2009)

To arrive at the goal of intensifying the trustworthiness and controllability of distributed systems, the core function of secure algorithms and chips should be fully exerted. Through building the trustworthy model between distributed system and user behaviors, constructing the architecture of trustworthiness distributed systems, intensifying the survivability of services, and strengthening the manageability of distributed systems, the secure problem of distributed systems is to be radically solved. By setting up the trustworthy computing circumstance and supplying the trustworthy validation and the active protection based on identity and behavior for trustworthy distributed system, we will reach the goal of defending the unaware viruses and inbreak. This research insists that the security, controllability, manageability, and survivability should be basic properties of a trustworthy distributed system. The key ideas and techniques involved in these properties are studied, and recent developments and progresses are surveyed. At the same time, the technical trends and challenges are briefly discussed.
Analysis on Disk Scheduling for Special User Functions
Venue: Proceedings of the 1996 International Conference on Multimedia Computing and Systems (1996)

Previous studies on disk scheduling for video services are usually based on computer simulation. In this paper, we present analysis on disk scheduling for video services. The purpose of the analysis is to obtain the maximum number of simultaneous video streams which can be supported by a disk using CLOOK or LOOK algorithm. The analysis is then extended to study disk scheduling for special user functions such as 'Forward Search' and 'Reverse Search'. Analysis on a technique called REdundancy for Special User Functions (RESUF) is also performed and the results show that the technique can keep theI/O demands to almost constant under all user request conditions.
The enlightenment to the Chinese insurance business
Authors: Junlu Wang
Venue: Proceedings of the 3rd WSEAS international conference on Computer engineering and applications (2009)

Since the American sub-debt crisis has erupted, has caused US's entity economy and even the whole world capital market fluctuation, Its influence effect does not allow to look down upon. The American International Group (AIG) takes the world insurance and the financial service leader, also has paid the huge price. Regarding China, the immediate influence which the crisis brings is limited The insurance business as the financial service industry's important composition department, This article thought that has the necessity to study it to our country insurance business enlightenment.
Application of spatial visualization for probabilistic hurricanes risk assessment to build environment
Authors: Yue Li, Tyler A. Erickson
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

Hurricanes have caused extensive economic losses and social disruption in the past two decades in the United States. A key component for improving building and infrastructure practices and public planning to reduce the economic losses due to hurricanes and their social impact is the ability to predict the expected damage that such events cause in buildings and other structures as well as the uncertainties in such predictions. Federal, state and county emergency management officers need an effective realtime tool to facilitate the decision regarding when evacuate should begin and who should evacuate before a hurricane, as long as how to timely conduct post-disaster relief. Modern internet-based geospatial tools can be effectively used to provide decision makers with real-time data, model results, and geospatial reference datasets. Probabilistic risk assessment model combined with spatial distributed visualization is proposed in this paper for more efficient hurricane hazard mitigation through risk informed communication.
A Bandwidth Friendly Search Engine
Authors: Clare Bradford, Ian. W. Marshall
Venue: Proceedings of the 1999 IEEE International Conference on Multimedia Computing and Systems - Volume 02 (1999)

The Internet plays host to many millions of documents and images and is increasing in size all the time. As a result locating web content is becoming increasingly difficult for users, and search traffic from users and spiders is increasing rapidly. A directory of the contents of the emerging cache hierarchy would be more complete than existing tools and avoid the need for spider traffic. However it is also essential to minimise the user traffic. A promising approach is to encourage users to refine their queries through categories. Automatic categorisation of a cache directory is demonstrated, and an adaptive categorisation scheme is proposed.
Challenges and requirements for new application generators
Authors: Alfonso F. Cardenas, William P. Grafton
Venue: Proceedings of the June 7-10, 1982, national computer conference (1982)

The need for application generation as an alternative to the aging programming languages (COBOL, FORTRAN, PL/1, Pascal, etc.) is put forth. Major technologies that participate in the movement toward application generation are reviewed. A variety of technical problems that plague these individual technologies are identified. The problem of lack of standards in the participating technologies is discussed. A satisfactory application generator (AG) should synthesize the overwhelming variety of services and individual technologies into a cohesive whole. The desired characteristics of an AG are indicated. Last, the resistance of programmers, analysts, and other specialists to embracing a new level of application development beyond handcoding in programming languages is indicated.
Detection of Ventricular Fibrillation by Support Vector Machine Algorithm
Authors: Qun Li, Jie Zhao, Yan-Na Zhao
Venue: Proceedings of the 2009 International Asia Conference on Informatics in Control, Automation and Robotics (2009)

With the increasing of sudden cardiac death, the developing of a reliable and portable electrocardiograph (ECG) monitor is imminent, especially automated external defibrillators (AEDs). A pivotal component in AEDs is the detection of ventricular fibrillation (VF) by means of appropriate detection algorithms. Various algorithms were proposed, here we proposed a new algorithm, which is based on support vector machine (SVM), Hurst index, and the time-delay algorithm [phase space reconstruction (PSR)]. For the new VF detection algorithm we calculated the sensitivity, specificity, positive predictivity and accuracy, then we compared these values with the results from an earlier investigation of several VF detection algorithms under equal conditions, using same databases and all of data without any preselection. We used the BIH-MIT arrhythmia database and the CU database. The result shows that the proposed algorithm has a high detection quality and outperforms all other investigated algorithms.
Photoshop Elements 7 for Windows Essential Training
Authors: Jan Kabili
Venue:  (2008)

Photoshop Elements 7 is packed with features to help amateur photographers with every stage of digital photo processing, from getting organized to sharing projects with family and friends. In Photoshop Elements 7 for Windows Essential Training, Jan Kabili shares workflow techniques for organizing, editing, creating projects, and sharing. She also demonstrates how to enhance photos with this budget-friendly software. Jan explains the latest updates to the Organizer and Editor workspaces, and also covers new features like the Smart Brush tool and Photoshop.com integration. Elements is very well known for its project features, and Jan shows how to create books, collages, panoramas, and more. Example files accompany the course. Topics Include: Getting photos from a camera, scanner, or files Organizing and finding photos with tags, albums, and Smart Collections Using automatic and guided edit tools for common fixes Mastering Full Edit mode for refining, retouching, and photo editing Adding special effects and text Sharing and backing up images on Photoshop.com Duration: 6.75 hoursOn 1 DVD-ROM System Requirements Macintosh Requirements OS 10.3.9 or higher DVD-ROM drive 1024x768 resolution 24-bit video support QuickTime 7 or higher Windows Requirements XP or Vista DVD-ROM Drive 1024x768 resolution 24-bit video support PC sound card/speakers QuickTime 7 or higher (included) .NET 2.0 or higher (included)
An Ant-Based Research on RWA in Optical Networks
Authors: Yan-lei Zheng, Wan-yi Gu, Shan-guo Huang, Pei Zhang
Venue: Proceedings of the 2009 International Conference on Electronic Computer Technology (2009)

The RWA problem is one of the most important issues in WDM optical networks. Most of conventional RWA (routing and wavelength assignment) approaches are based on the centralized communication policy, but the dynamic routing information included in the network can not be thoroughly obtained. In this paper, we propose an improved algorithm which integrates ant-colony and FF algorithm to solve the RWA problem. The algorithm is applied for the simple network with 9 nodes in physical topology. From the analytic and experimental results, our distributed routing policy can realize the task of path selection with lower blocking probability and higher resources utilization in an acceptable time performance.
The multivariate moving window spectral method
Authors: Dennis Ridley, Pierre Ngnepieba
Venue: Computers and Industrial Engineering (2009)

The Univariate Moving Window Spectral method is extended to the Multivariate Moving Window Spectral method (MWS). This further mitigates the bias encountered in time series model parameter estimates, that otherwise results in multiple-period lead time forecast error divergence. Compared to time domain methods, the spectral approach provides for better estimation of cyclical components in time series. When recombined by the MWS paradigm, better long range forecasts are possible. The method is illustrated by a tri-variate sales, price and income case study. The multivariate MWS method requires little user expertise, explains the data better, and forecasts better. It is applicable to a broad range of biomedical, physical, economic, and social science time series.
Complexity of the Packing Coloring Problem for Trees
Authors: Jiří Fiala, Petr A. Golovach
Venue: Graph-Theoretic Concepts in Computer Science: 34th International Workshop, WG 2008, Durham, UK, June 30 --- July 2, 2008. Revised Papers (2008)

Packing coloring is a partitioning of the vertex set of a graph with the property that vertices in the i-th class have pairwise distance greater than i. We solve an open problem of Goddard et al. and show that the decision whether a tree allows a packing coloring with at most k classes is NP-complete.We accompany this NP-hardness result by a polynomial time algorithm for trees for closely related variant of the packing coloring problem where the lower bounds on the distances between vertices inside color classes are determined by an infinite nondecreasing sequence of bounded integers.
They Will Come to Town
Authors: Thilo Ewers
Venue: ACM SIGGRAPH ASIA 2008 computer animation festival (2008)

New York is still. Not a soul in sight. The caf&eacute;s are all empty. No lights are burning. The city seems dead, as if it was just recently deserted. Then shadows begin to fall over the streets and buildings. Their numbers keep increasing. When the view is cleared, a whale and some schools of fish majestically float overhead. We see a total view of New York and realise that the entire city lies under water and is now populated by ocean creatures.