ppxscal/embedding_network huggingface dataset:
Graceful degradation in server overload using adaptive content
Authors: Henri Qais Naccache
Venue:  (2008)

Current web application-level Quality of Service (QoS) frameworks resort to refusing requests when met with overload. The proposed self-healing adaptive content framework (SHAC) will allow dynamic web-based applications to adapt their output in order to minimize the effects of flash crowds and server overload without refusing requests. A methodology to create a SHAC system for existing web applications is presented. An analytical Queuing Network model is created to predict the performance impact of the framework on existing systems. A PID controller-based autonomic manager is implemented to maintain response times below that of a preset service level agreement. Evaluation of the framework is shown through implementations in web services, a portal, an AJAX-driven systems and a blog server along with significant performance testing and QoS analysis.
Musical Style Identification with n-Grams and Neural Networks
Authors: Pedro P. Cruz-Alcázar, María J. Castro-Bleda
Venue: Proceedings of the 13th Iberoamerican congress on Pattern Recognition: Progress in Pattern Recognition, Image Analysis and Applications (2008)

Musical Style Identification (MSI) aims to automatically classify music by style. It is being recently explored, mostly in the field of multimedia databases, with potential applications to content-based retrieval. But MSI may be also employed in other applications. We try to face up this challenge with two different methodologies: n-gram Models and Neural Networks. Very good results were obtained with n-grams in our previous research and we were willing to test how other Artificial Intelligence techniques performed with this task, so we began a preliminary study with Multilayer Perceptrons that is promising.
Straight Line Extraction for Stereoimage Feature Matching
Authors: Shenghua Xu, Jiping Liu, Jianping Pan, Yong Wang
Venue: Proceedings of the 2008 Congress on Image and Signal Processing, Vol. 2 - Volume 02 (2008)

Linear feature can provide more information than point feature and can be extracted and described conveniently compared with the planar structure in the aerial images, a new straight line extraction method for steroimage feature matching is proposed, mainly for the man-made objects. The fusion and the filtering strategies are designed for the linear features extracted from the aerial images, and then feature grouping is implemented among the linear features, and each feature group contains its associated matching relationships. The experimental results show that the proposed algorithm is not only more efficient and robust but also can get richer and more accurate straight line information, especially for the buildings.
ActivePlace, a Unified Collaboration Environment
Authors: Yu You, Panu M. Åkerman, Suresh Chande
Venue: Proceedings of the 5th international conference on Cooperative Design, Visualization, and Engineering (2008)

As Workplaces are being equipped with communication-oriented software more and more people are faced with the need to handle with multiple communication contexts in environments with ever increasing multi-tasking nature. The increased complexity of managing communication in different contexts is becoming more demanding than ever before. This paper presents a unified collaborative system named ActivePlace, which enables context-awareness in communication and collaboration. In this paper we discuss the new design we applied compared to the traditional online room-based workplace systems, such as use of context-aware extended presence and the concept of activity awareness for places. The ActivePlace provides an infrastructure for communication and collaboration in a context-sensitive basis.
A Novel Situation Awareness Model for Network Systems' Security
Authors: Guosheng Zhao, Huiqiang Wang, Jian Wang, Linshan Shen
Venue: Proceedings of the 7th international conference on Computational Science, Part III: ICCS 2007 (2007)

Building and maintaining the information superiority is the basis of the principle of active defense, integrated guarding in the cyberspace. In this paper, a novel method based on grey verhulst model was introduced to forecast the network system's security situation. Starting with unequal interval original risk data series, the proposed method choosed grey verhulst model or its inverse function to forecast the future risk value of network system, ant then it could modify the forecasting precision based on multilevel residual error. Simulation results reveal that the presented model not only gains the intuitionistic curve graph of network security situation, but also can achieve satisfactory precision. At the same time, it is simple in use and deserves further study to fully explore its potential for evaluation issues.
Utilizing Feature Diagrams to Assess the Capabilities of Tools That Support the Model Driven Architecture
Authors: Benjamin Gorry
Venue: Proceedings of the 5th international conference on Diagrammatic Representation and Inference (2008)

The Model Driven Architecture (MDA) is being increasingly adopted as part of the systems development life cycle. A plethora of tools which support the MDA are currently available. The time it takes to gain knowledge of the capabilities of a particular tool can be costly. This poster outlines how Feature Diagrams have been used to provide a graphical representation of the capabilities of a set of given MDA tools.
Indirect Training of Grey-Box Models: Application to a Bioprocess
Authors: Francisco Cruz, Gonzalo Acuña, Francisco Cubillos, Vicente Moreno, Danilo Bassi
Venue: Proceedings of the 4th international symposium on Neural Networks: Part II--Advances in Neural Networks (2007)

Grey-box neural models mix differential equations, which act as white boxes, and neural networks, used as black boxes. The purpose of the present work is to show the training of a grey-box model by means of indirect backpropagation and Levenberg-Marquardt in Matlab®, extending the black box neural model in order to fit the discretized equations of the phenomenological model. The obtained grey-box model is tested as an estimator of a state variable of a biotechnological batch fermentation process on solid substrate, with good results.
Visiting a Polygon on the Optimal Way to a Query Point
Authors: Ramtin Khosravi, Mohammad Ghodsi
Venue: Proceedings of the 2nd annual international workshop on Frontiers in Algorithmics (2008)

We study a constrained version of the shortest path problem in polygonal domains, in which the path must visit a given target polygon. We provide an efficient algorithm for this problem based on the wavefront propagation method and also present a method to construct a subdivision of the domain to efficiently answer queries to retrieve the constrained shortest paths from a single-source to the query point.
Divided Backend Duplication Methodology for Balanced Dual Rail Routing
Authors: Karthik Baddam, Mark Zwolinski
Venue: Proceeding sof the 10th international workshop on Cryptographic Hardware and Embedded Systems (2008)

Dual Rail Precharge circuits offer an effective way to address Differential Power Analysis Attacks, provided routing of differential signals is fully balanced. Fat Wire [1] and Backend Duplication [2] methods address this problem. However they do not consider the effect of coupling capacitance on adjacent differential signals. In this paper we propose a new method, Divided Backend Duplication, which is based on Divided Wave Dynamic Differential Logic [3] and Backend Duplication [2], that effectively addresses balanced routing problem of Dual Rail Precharge circuits. Experimental results on an AES test circuit in 130nm technology show improvements in achieving a balanced dual rail design. Further our method can also be successfully applied to FPGAs. Results from an sbox test circuit implementation on a Xilinx FPGA are presented.
Wavelet-based image registration technique for high-resolution remote sensing images
Authors: Gang Hong, Yun Zhang
Venue: Computers Geosciences (2008)

Image registration is the process of geometrically aligning one image to another image of the same scene taken from different viewpoints at different times or by different sensors. It is an important image processing procedure in remote sensing and has been studied by remote sensing image processing professionals for several decades. Nevertheless, it is still difficult to find an accurate, robust, and automatic image registration method, and most existing image registration methods are designed for a particular application. High-resolution remote sensing images have made it more convenient for professionals to study the Earth; however, they also create new challenges when traditional processing methods are used. In terms of image registration, a number of problems exist in the registration of high-resolution images: (1) the increased relief displacements, introduced by increasing the spatial resolution and lowering the altitude of the sensors, cause obvious geometric distortion in local areas where elevation variation exists; (2) precisely locating control points in high-resolution images is not as simple as in moderate-resolution images; (3) a large number of control points are required for a precise registration, which is a tedious and time-consuming process; and (4) high data volume often affects the processing speed in the image registration. Thus, the demand for an image registration approach that can reduce the above problems is growing. This study proposes a new image registration technique, which is based on the combination of feature-based matching (FBM) and area-based matching (ABM). A wavelet-based feature extraction technique and a normalized cross-correlation matching and relaxation-based image matching techniques are employed in this new method. Two pairs of data sets, one pair of IKONOS panchromatic images from different times and the other pair of images consisting of an IKONOS panchromatic image and a QuickBird multispectral image, are used to evaluate the proposed image registration algorithm. The experimental results show that the proposed algorithm can select sufficient control points semi-automatically to reduce the local distortions caused by local height variation, resulting in improved image registration results.
Human Genome Data Visualization Using a Wall Type Display
Authors: Kunihiro Nishimura, Tomohiro Tanikawa, Michitaka Hirose
Venue: Proceedings of the 8th Asia-Pacific conference on Computer-Human Interaction (2008)

Information visualization is an effective method to grasp a complete view of huge data. In the field of genome science, researchers are faced with a large biological data set analysis. Large biological data set are accumulated in public web sites. They want to grasp whole view of the data and extract biological meanings from the data. We have taken an information visualization approach for supporting genome data analysis. In addition, we have chosen a wide viewing angle display, a wall type display which enables us to experiment virtual environment, as a display of visualized data. A wall type display has an ability to present large amount of data in the broad view. It will help users to see the data summary and to detect abnormal regions. In this paper, we discuss human genome data visualization using a wall type display. We could present a human chromosome data on the wall. This could help genome researchers to browse the data.
Simulation Using Orchestration
Authors: David Kitchin, Evan Powell, Jayadev Misra
Venue: Proceedings of the 12th international conference on Algebraic Methodology and Software Technology (2008)

The real world is inherently concurrent and temporal. For simulating physical phenomena of the real world, one prefers frameworks which easily express concurrency and account for the passage of time. We propose Orc, a structured concurrent calculus, as a framework for writing simulations. Orc provides constructs to orchestrate the concurrent invocation of services while managing time-outs, priorities, and failures of services or communication. Orc's treatment of time is of particular interest in simulation. We propose an abstract notion of time and show its utility in coding simulations. We also show how Orc's structure allows us to compute statistics from a simulation.
A New Tool for Assurance of Perfect Nonlinearity
Authors: Nuray At, Stephen D. Cohen
Venue: Proceedings of the 5th international conference on Sequences and Their Applications (2008)

Let f(x) be a mapping f: GF(p n ) ¿GF(p n ), where p is prime and GF(p n ) is the finite field with p n elements. A mapping f is called differentially k-uniform if k is the maximum number of solutions x ¿ GF(p n ) of f(x + a) ¿ f(x) = b, where a, b ¿ GF(p n ) and a ¿ 0. A 1-uniform mapping is called perfect nonlinear (PN). In this paper, we propose an approach for assurance of perfect nonlinearity which involves simply checking a trace condition.
Algorithms and Experimental Study for the Traveling Salesman Problem of Second Order
Authors: Gerold Jäger, Paul Molitor
Venue: Proceedings of the 2nd international conference on Combinatorial Optimization and Applications (2008)

We introduce a new combinatorial optimization problem, which is a generalization of the Traveling Salesman Problem (TSP) and which we call Traveling Salesman Problem of Second Order (2-TSP). It is motivated by an application in bioinformatics, especially the Permuted Variable Length Markov model. We propose seven elementary heuristics and two exact algorithms for the 2-TSP, some of which are generalizations of similar algorithms for the Asymmetric Traveling Salesman Problem (ATSP), some of which are new ideas. Finally we experimentally compare the algorithms for random instances and real instances from bioinformatics. Our experiments show that for the real instances most heuristics lead to optimum or almost-optimum solutions, and for the random instances the exact algorithms need less time than for the real instances.
Using Padding to Optimize Locality in Scientific Applications
Authors: E. Herruzo, O. Plata, E. L. Zapata
Venue: Proceedings of the 8th international conference on Computational Science, Part I (2008)

Program locality exploitation is a key issue to reduce the execution time of scientific applications, so as many techniques have been designed for locality optimization. This paper presents new compiler algorithms based on array padding that optimize program locality either locally (at loop level) or globally (the whole program). We first introduce a formal cache model that is used to analyze how all cache levels are filled up when arrays inside nested loops are referenced. We further study the relation between the model parameters and the data memory layout of the arrays, and define how to pad those arrays in order to optimize cache occupation at all levels. Experimental evaluation on some numerical benchmarks shows the benefits of our approach.
Semi-automated Building extraction from CAD-Based Photogrammetry
Authors: Ling Yang, Jianqing Zhang
Venue: Proceedings of the 2008 Congress on Image and Signal Processing, Vol. 2 - Volume 02 (2008)

The method of using pre-defined models to extract spatial information of man-made object digital image is called model-base object extraction, which has been a convincible approach to improve the existing Photogrammetry techniques. This paper used a semi-automated approach to extracting buildings from single aerial image by the Least-squares model-image fitting (LSMIF) algorithm. Each CAD model is associated with a set of pose parameters as well as a set of shape parameters and then projected to the image, by fitting the model to the image, these parameters will reveal both the location parameters and shape parameters. The work flow of this paper is as fellows: Firstly, the CAD model was selected and the approximate model parameters were given manually, then the parameterized model was projected to the image and the true values of parameters were calculated automatically. Experiment was done, and the result is good.
Segmentation of Rigid Motion from Non-rigid 2D Trajectories
Authors: Alessio Bue, Xavier Lladó, Lourdes Agapito
Venue: Proceedings of the 3rd Iberian conference on Pattern Recognition and Image Analysis, Part I (2007)

In this paper we evaluate an automatic segmentation algorithm able to identify the set of rigidly moving points within a deformable object given the 2D measurements acquired by a perspective camera. The method is based on a RANSAC algorithm with guided sampling and an estimation of the fundamental matrices from pairwise frames in the sequence. Once the segmentation of rigid and non-rigid points is available, the set of rigid points could be used to estimate the internal camera calibration parameters, the overall rigid motion and the non-rigid 3D structure.
A diagrammatic reasoning system for the description logic ALC
Authors: Frithjof Dau, Peter Eklund
Venue: Journal of Visual Languages and Computing (2008)

Diagrammatic reasoning is a tradition of visual logic that allows sentences that are equivalent to first order logic to be written in a visual or structural form: usually for improved usability. A calculus for the diagram can then be defined that allows well-formed formulas to be derived. This calculus is intended in the analog of logical inference. Description logics (DLs) have become a popular knowledge representation and processing language. DLs correspond to decidable fragments of first order logic; their notation is in the style of symbolic, variable-free formulas. Moreover, DLs are equipped with table au theorem provers that are proven to be sound and complete. Although DLs have roots in diagrammatic languages (such as semantic networks), they are elaborated in a purely symbolic manner. This paper discusses how DLs can be equivalently represented in terms of a diagrammatic reasoning system. First, existing diagrammatic reasoning systems, namely spider- and constraint diagrams, as well as existential and conceptual graphs, are investigated to determine if they are compatible with DLs. It turns out that Peirce's existential graphs are better suited for this purpose than the alternatives we examine. The paper then redevelops the DL ALC, which is the smallest propositional DL, by means of labeled trees, and provides a diagrammatic representation for these trees in the style of Peircean graphs. We provide a calculus based on C.S. Peirce's calculus for existential graphs and prove the soundness and completeness of the calculus. The calculus acts on labeled trees, but can be best understood as a diagrammatic calculus whose rules modify the Peircean-style representation of ALC.
Development of an Educational System to Control Robots for All Students
Authors: Toshiyuki Kamada, Hiroyuki Aoki, Shuji Kurebayashi, Yoshikazu Yamamoto
Venue: Proceedings of the 3rd international conference on Informatics in Secondary Schools - Evolution and Perspectives: Informatics Education - Supporting Computational Thinking (2008)

Machines controlled by computers are spreading in almost all areas of our society. However, students are not aware of the existence of such devices. At present, we have developed an educational system for secondary schools that can implement realistic computer controlled, autonomous mechanics. The system is composed of a controller board as hardware and a structured control language on top of the Dolittle programming language as software. Mechanics controlled by the controller board can be arranged according to the teacher's wishes. The biggest contribution of our system is its low-cost; students can bring their work home and use the system. In this paper, the design concept of our educational system and the design details are described. We then include the results of a survey which was taken at workshops for lower secondary school teachers.
Authoring, viewing, and generating hypervideo: An overview of Hyper-Hitchcock
Authors: Frank Shipman, Andreas Girgensohn, Lynn Wilcox
Venue: ACM Transactions on Multimedia Computing, Communications, and Applications (TOMCCAP) (2008)

Hyper-Hitchcock consists of three components for creating and viewing a form of interactive video called detail-on-demand video: a hypervideo editor, a hypervideo player, and algorithms for automatically generating hypervideo summaries. Detail-on-demand video is a form of hypervideo that supports one hyperlink at a time for navigating between video sequences. The Hyper-Hitchcock editor enables authoring of detail-on-demand video without programming and uses video processing to aid in the authoring process. The Hyper-Hitchcock player uses labels and keyframes to support navigation through and back hyperlinks. Hyper-Hitchcock includes techniques for automatically generating hypervideo summaries of one or more videos that take the form of multiple linear summaries of different lengths with links from the shorter to the longer summaries. User studies on authoring and viewing provided insight into the various roles of links in hypervideo and found that player interface design greatly affects people's understanding of hypervideo structure and the video they access.
Modulation Recognition Method Based on High Order Cyclic Cumulants for Time-Frequency Overlapped Two-Signal in the Single-Channel
Authors: Kuang-dai Li, Li-li Guo, Rong Shi, Dan Wu
Venue: Proceedings of the 2008 Congress on Image and Signal Processing, Vol. 5 - Volume 05 (2008)

To solve the problems in modulation recognition of time-frequency overlapped two-signal in the single-channel, an algorithm based on cyclic cumulants used modulation recognition is presented. Through computing the fourth-order cyclic cumulants of pretreated band signals, the feature vector for classification was extracted, and then use the minimum-error criterion to classify time-frequency overlapped two-signal automaticly. Theoretical analysis and experiment results both verify that the algorithm is correct and efficient.
The effects of wiki- and blog-technologies on the students' performance when learning the preterite and imperfect aspects in spanish
Authors: Terence C. Ahern
Venue:  (2007)

This study investigated the influence of asynchronous computer text based technologies on the students&rsquo; performance when learning the preterite and the imperfect aspects. The technology used was a blog powered by Blogger and a wiki powered by Wikispaces. Two research questions guided the study: Research Question 1: Is there a difference in students&rsquo; achievement levels in Spanish preterite and imperfect between those using wiki-technologies and those using blog technologies after controlling for pre-intervention achievement levels? and Research Question 2: Are there differences in satisfaction levels for students learning Spanish preterite and imperfect via blog technologies as compared to those learning via wiki technologies? The research method used for this study was quantitative quasi-experimental design. The number of participants for this study was 45 enrolled in two sections of college-level Intermediate Spanish 2 (Spanish 204). Four instruments were used to gather the data of this study: a demographic survey, a pre and post test, an attitudinal survey and a rubric to grade the production component of the pre and post test. Results indicate that there were not significant differences between students who use blog or wiki technologies on performance levels when controlling for pre-existing knowledge. Results also indicated that there were not significant differences in satisfaction levels between those students using a wiki and those using a blog.