ppxscal/embedding_network huggingface dataset:
Models and framework for supporting runtime decisions in Web-based systems
Authors: Mauro Andreolini, Sara Casolari, Michele Colajanni
Venue: ACM Transactions on the Web (TWEB) (2008)

Efficient management of distributed Web-based systems requires several mechanisms that decide on request dispatching, load balance, admission control, request redirection. The algorithms behind these mechanisms typically make fast decisions on the basis of the load conditions of the system resources. The architecture complexity and workloads characterizing most Web-based services make it extremely difficult to deduce a representative view of a resource load from collected measures that show extreme variability even at different time scales. Hence, any decision based on instantaneous or average views of the system load may lead to useless or even wrong actions. As an alternative, we propose a two-phase strategy that first aims to obtain a representative view of the load trend from measured system values and then applies this representation to support runtime decision systems. We consider two classical problems behind decisions: how to detect significant and nontransient load changes of a system resource and how to predict its future load behavior. The two-phase strategy is based on stochastic functions that are characterized by a computational complexity that is compatible with runtime decisions. We describe, test, and tune the two-phase strategy by considering as a first example a multitier Web-based system that is subject to different classes of realistic and synthetic workloads. Also, we integrate the proposed strategy into a framework that we validate by applying it to support runtime decisions in a cluster Web system and in a locally distributed Network Intrusion Detection System.
The Evaluation of Wavelet and Data Driven Feature Selection for Image Understanding
Authors: Liu Jinshuo, Zhang Dengyi, Liu Siwen, Fang Ying, Zhang Ming
Venue: Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics - Volume 02 (2008)

Image mining with pattern recognition methods has been widely used to understand the image knowledge. The general rule for the number of features is that the number can not be too much to improve the efficiency and speed of mining. This paper presents the wavelet methods for feature compression, and gives the evaluation of the wavelet methods comparing with data driven feature selection using the example of the project of image mining of pathogen yeast Cryptococcus Neoformans. The experiments show that the wavelet methods for feature compression are almost as effective as data driven feature selection to identify variance pathogen condition. The experiments are built on the training images set and evaluated using the new test set images with machine learning tool WEKA.
Comparing the GLC2000 and GeoCover LC land cover datasets for use in economic modelling of land use
Authors: G. C. Nelson, R. D. Robertson
Venue: International Journal of Remote Sensing (2007)

This paper compares two recent near-global land cover (GLC) datasets, GLC 2000 and GeoCover LC, with differing resolutions (1km versus 30 m) for their potential usefulness in economic analyses of the determinants of land use. The comparisons are for two ecologically distinct parts of the world-Sumatra and the Horn of Africa. Cross-tabs that provide different views of the datasets are developed and reported. We expected to find heterogeneity in 1km categories that were identified as mosaic and did. More surprising is the degree of heterogeneity of the categories one might expect to be homogeneous. For both regions, a 1km pixel often appears to include a wide range of economic activities that are likely to respond to economic and social forces in different ways. Hence, using the 1km data as representative of land use in models of location-specific socioeconomic response, such as to climate change or land use policies is especially problematic, even if the classification accuracy were very high.
Complexity of Topological Properties of Regular &omega;-Languages
Authors: Victor L. Selivanov, Klaus W. Wagner
Venue: Fundamenta Informaticae (2008)

We determine the complexity of topological properties (i.e., properties closed under the Wadge equivalence) of regular &omega;-languages by showing that they are typically NL-complete (PSPACE-complete) for the deterministic Muller, Mostowski and B&uuml;chi automata (respectively, for the nondeterministic Rabin, Muller, Mostowski and B&uuml;chi automata). For the deterministic Rabin and Streett automata and for the nondeterministic Streett automata upper and lower complexity bounds for the topological properties are established.
Magnetic Resonance Imaging and Diffusion Weighted Imaging Appearance of Cerebellar Liponeurocytoma
Authors: J. T. Guan, G. Guo, Y. Q. Geng, X. H. Xu, X. J. Yu
Venue: Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics - Volume 02 (2008)

Cerebellar liponeurocytoma is a rare benign neuroepithelial tumor. We describe the case of a 50-year-old man, presenting with signs of increased intracranial pressure and cerebellar dysfunction. Magnetic Resonance Imaging (MRI) showed a heterogeneous, well-circumscribed cerebellar mass with a predominant adipose content. Diffusion Weighted Imaging (DWI) showed an isointense mass with a hyperintense rim Craniotomy demonstrated a soft, gray mass with intratumoral bright patchy yellow areas. Histological and immunohistochemical findings indicated an advanced neuronal, glial and focal lipomatous differentiation with a low level of mitotic activity.
A Model for Behavioral Patterns in Web-Based Learning Environments
Authors: Chih-Ping Chu, Yi-Chun Chang
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications (2008)

As Internet use has proliferated, web-based learning systems have become more and more popular. Numerous researchers have spent a great deal of effort to facilitate the promotion of high quality web-based learning environments, such as intelligent web-based learning systems and adaptive learning. To facilitate such researches, students’ behavioral patterns must be observed and experimentally analyzed. However, building a web-based learning system and the requisite collecting of behavioral patterns usually takes a great deal of time and effort. To solve this problem, this paper proposes a learning behavioral model based on Colored Petri Nets (CPN) to model and generate students’ behavioral patterns. To verify the viability of the proposed model, this paper compares actual data collected from elementary school students with the behavioral pattern generated by the proposed model. The results prove: (1) The generated behavioral pattern approaches actual student behavior; (2) The generated behavioral pattern serves as adequate test data to test whether the predicted learning content of an intelligent e-learning system is appropriate; and (3) The proposed model is capable of recommending the appropriate learning content for students utilizing e-learning systems.
Visual analysis of controversy in user-generated encyclopedias
Authors: Ulrik Brandes, Jürgen Lerner
Venue: Information Visualization (2008)

Wikipedia is a large and rapidly growing Web-based collaborative authoring environment, where anyone on the Internet can create, modify, and delete pages about encyclopedic topics. A remarkable property of some Wikipedia pages is that they are written by up to thousands of authors who may have contradicting opinions. In this paper, we show that a visual analysis of the 'who revises whom'-network gives deep insight into controversies. We propose a set of analysis and visualization techniques that reveal the dominant authors of a page, the roles they play, and the alters they confront. Thereby we provide tools to understand how Wikipedia authors collaborate in the presence of controversy.
Graph sparsification by effective resistances
Authors: Daniel A. Spielman, Nikhil Srivastava
Venue: Proceedings of the 40th annual ACM symposium on Theory of computing (2008)

We present a nearly-linear time algorithm that produces high-quality sparsifiers of weighted graphs. Given as input a weighted graph G=(V,E,w) and a parameter ε>0, we produce a weighted subgraph H=(V,~E,~w) of G such that |~E|=O(n log n/ε2) and for all vectors x in RV. (1-ε) ∑uv ∈ E (x(u)-x(v))2wuv≤ ∑uv in ~E(x(u)-x(v))2~wuv ≤ (1+ε)∑uv ∈ E(x(u)-x(v))2wuv. This improves upon the sparsifiers constructed by Spielman and Teng, which had O(n logc n) edges for some large constant c, and upon those of Benczur and Karger, which only satisfied (1) for x in {0,1}V. We conjecture the existence of sparsifiers with O(n) edges, noting that these would generalize the notion of expander graphs, which are constant-degree sparsifiers for the complete graph. A key ingredient in our algorithm is a subroutine of independent interest: a nearly-linear time algorithm that builds a data structure from which we can query the approximate effective resistance between any two vertices in a graph in O(log n) time.
Theoretical study on structures of gold, silver and copper clusters using relativistic model core potentials
Authors: H. Nakashima, H. Mori, Ma San Mon, E. Miyoshi
Venue: Proceedings of the 1st WSEAS International Conference on Computational Chemistry (2007)

We investigated the lowest-energy structures of Au, Ag and Cu clusters up to octamer using model core potentials (MCPs). We utilized several levels of theory, such as density functional theory (B3LYP, BLYP, PBEPBE, LC-BLYP, LC-BOP), second-order perturbation theory (MP2) and coupled cluster method (CCSD(T)). The MP2 calculations predicted that the Au, Ag and Cu clusters have the crossover from planar to non-planar at heptamer. In contrast, all the DFT and coupled cluster methods predicted that all the gold clusters up to octamer are planar but for the Ag and Cu clusters the crossover from planar to non-planar occurs at heptamer.
A Framework for Statechart Based Component Reconfiguration
Authors: Xabier Elkorobarrutia, Mikel Muxika, Goiuri Sagardui, Frank Barbier, Xabier Aretxandieta
Venue: Proceedings of the Fifth IEEE Workshop on Engineering of Autonomic and Autonomous Systems (2008)

This article describes a reconfiguration mechanism for statechart-based software components and presents a framework that supports it. The reconfiguration capability that each component acquires can be used as a mechanism for self-healing and better adapting the component to environmental condition variations. The latter can also be considered as a support for coping with incomplete or bad specifications due to the lack of exact knowledge of the environment. It will also be shown that it can be used to easier resolve composition issues when creating a system by means of component-composition. This framework helps creating statechart based components that reside in the middle ground between a blackbox component and an statechart interpreter. In addition to supporting a Model Driven development style, the framework creates a reflective architecture of the component without any involvement from the developer. This reflectiveness adds the ability to modify the component’s statechart model at run-time and can be used as a basis for a self healing mechanism.
Column-stores vs. row-stores: how different are they really?
Authors: Daniel J. Abadi, Samuel R. Madden, Nabil Hachem
Venue: Proceedings of the 2008 ACM SIGMOD international conference on Management of data (2008)

There has been a significant amount of excitement and recent work on column-oriented database systems ("column-stores"). These database systems have been shown to perform more than an order of magnitude better than traditional row-oriented database systems ("row-stores") on analytical workloads such as those found in data warehouses, decision support, and business intelligence applications. The elevator pitch behind this performance difference is straightforward: column-stores are more I/O efficient for read-only queries since they only have to read from disk (or from memory) those attributes accessed by a query. This simplistic view leads to the assumption that one can obtain the performance benefits of a column-store using a row-store: either by vertically partitioning the schema, or by indexing every column so that columns can be accessed independently. In this paper, we demonstrate that this assumption is false. We compare the performance of a commercial row-store under a variety of different configurations with a column-store and show that the row-store performance is significantly slower on a recently proposed data warehouse benchmark. We then analyze the performance difference and show that there are some important differences between the two systems at the query executor level (in addition to the obvious differences at the storage layer level). Using the column-store, we then tease apart these differences, demonstrating the impact on performance of a variety of column-oriented query execution techniques, including vectorized query processing, compression, and a new join algorithm we introduce in this paper. We conclude that while it is not impossible for a row-store to achieve some of the performance advantages of a column-store, changes must be made to both the storage layer and the query executor to fully obtain the benefits of a column-oriented approach.
Error Forecasting Schemes of Error Correction at Receiver
Authors: Chandan T. Bhunia
Venue: Proceedings of the Fifth International Conference on Information Technology: New Generations (2008)

To combat error in computer communication networks, ARQ (Automatic Repeat Request) techniques are used. Recently Chakraborty has proposed a simple technique called the packet combining scheme in which error is corrected at the receiver from the erroneous copies. Packet Combining (PC) scheme fails: (i) when bit error locations in erroneous copies are the same and (ii) when multiple bit errors occur. Both these have been addressed recently by two schemes known as Packet Reversed Packet Combining (PRPC) Scheme, and Modified Packet Combining (MPC) Scheme respectively. In the letter, two error forecasting correction schemes are reported, which in combination with PRPC offer higher throughput.
The Mathematic Model of Consciousness
Authors: Zhang Yinsheng
Venue: Proceedings of the 2008 Second Asia International Conference on Modelling & Simulation (AMS) (2008)

The thought referring homomorphism of a group to the model of transformation from physical structures to the psychological originated from Jean Piaget. How ever, Jean Piaget has not given a mathematic expression by which the psychological phenomena can be represented, and he has not taking the model as the common model of consciousness. In the paper, the homomorphic model of consciousness is given in a mathematic expression, by which the some important questions relevant to the consciousness are formalized and the answer can be acquired, the questions (with the followed answer solved by the homomorphic model of consciousness) are Chinese room argument, Turing machine question, Turing Test question, and about if animals have consciousness, in what the meaning of utilizing and making tools lies, if DNA and protein system have consciousness. And finally the paper concludes that consciousness exists when : (1) the units of system certainly map the entities outside the system; (2) the system operate by some rules; and (3) the rules certainly map some laws or relations in the entities. The essence of consciousness is certain correspondence between substance with some rules or laws.
Broadening participation in computing with the k-gray engineering pathway digital library
Authors: Alice Agogino, Michael Smith
Venue: Proceedings of the 8th ACM/IEEE-CS joint conference on Digital libraries (2008)

This demonstration presents a digital library for educators at all levels to easily identify, select, and use educational resources that have been shown through research to be effective for increasing the participation of women and under-represented minorities in information technology. The library consists of practices from the Broadening Participation in Computing (BPC) program in NSF CISE and elsewhere that have been researched or evaluated for their promise or effectiveness to recruit, retain, or advance under-represented groups in IT fields of study or research careers. We do not develop the practices, but instead describe them and make them easy for users to find and evaluate in a central location.
Correlation analysis on water quality parameter with aquatic insects abundance in Telipok river, Sabah, Malaysia
Authors: Kamsia Budin, Amran Ahmed, Noraini Abdullah, Maryam Dawalih
Venue: Proceedings of the 12th WSEAS International Conference on Applied Mathematics (2007)

This research was conducted to evaluate the association between aquatic insect with water parameter as pH, turbidity, dissolved oxygen and total suspended solids in Telipok River, Sabah. Sampling were done in September 2007 with 9 main station (6 sub sampling site) using kicking and dipping method to collect the aquatic insect which later on were identify with taxonomy keys. Logger@Pro meter was used to determine the water parameter value and it shows that station 1 and 2 were in Class IIA and station 3 to 9 were in Class III, based on INTERIM, Malaysia. Aquatic insects in order Ephemeroptera, Pleocoptera and Tricoptera (EPT) were found abundant in station 1 and 2, Odonata were scattered evenly in all station and Diptera were found mainly in station 3 to 9. Pearson correlation shows that EPT abundance has a negative correlation with turbidity and total suspended solids but a positive correlation was observed between the EPT with dissolved oxygen. However, Odonata and Diptera shows a diverse results suggesting that the EPT existence are suitable to indicate any water quality changes especially on the dissolved oxygen, total suspend solid and turbidity in a river such as Telipok River better than Odonata and Diptera.
Many random walks are faster than one
Authors: Noga Alon, Chen Avin, Michal Koucky, Gady Kozma, Zvi Lotker, Mark R. Tuttle
Venue: Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures (2008)

We pose a new and intriguing question motivated by distributed computing regarding random walks on graphs: How long does it take for several independent random walks, starting from the same vertex, to cover an entire graph? We study the cover time - the expected time required to visit every node in a graph at least once - and we show that for a large collection of interesting graphs, running many random walks in parallel yields a speed-up in the cover time that is linear in the number of parallel walks. We demonstrate that an exponential speed-up is sometimes possible, but that some natural graphs allow only a logarithmic speed-up. A problem related to ours (in which the walks start from some probablistic distribution on vertices) was previously studied in the context of space efficient algorithms for undirected s-t-connectivity and our results yield, in certain cases, an improvement upon some of the earlier bounds.
A Stochastic Programming Approach for QoS-Aware Service Composition
Authors: Wolfram Wiesemann, Ronald Hochreiter, Daniel Kuhn
Venue: Proceedings of the 2008 Eighth IEEE International Symposium on Cluster Computing and the Grid (2008)

We formulate the service composition problem as a multi-objective stochastic program which simultaneously optimizes the following quality of service (QoS) parameters: workflow duration, service invocation costs, availability, and reliability. All of these quality measures are modelled as decision-dependent random variables. Our model minimizes the average value-at-risk (AVaR) of the workflow duration and costs while imposing constraints on the workflow availability and reliability. AVaR is a popular risk measure in decision theory which quantifies the expected shortfall below some percentile of a loss distribution. By replacingthe random durations and costs with their expected values, our risk-aware model reduces to the nominal problem formulation prevalent in literature. We argue that this nominal model can lead to overly risky decisions. Finally, we report on the scalability properties of our model.
Digital Certificate Mobile Agent Technologies in Distance Learning
Authors: Dong-Liang Lee, Lawrence Y. Deng
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications - Workshops (2008)

Security issues have become more and more important in network application. This paper proposed an application of distance learning which integrated with Citizen Digital Certificate (CDC) Public Key Infrastructure (PKI), including the grade uploading, student information inquiring, and electronic documentation flow control. We integrated a tracking and persistent agent-based mobility management system in the case of distance learning. The main purpose of this system is addressed to achieve the universal access objective. We addressed to solve the problems in case of the data transferring in the network, such as eavesdropping, snooping, modification, masquerading and repudiation. And this would improve the efficiency of entire computerize procedure of electronic campus policy totally which in the following projects: Grade Processing System and Governmental Autographing System, etc. Especially, the Grade Uploading System was the first time to integrate with CDC. This experience was very important to integrate/generate the most secured application system in the Distance Learning.
On Extracting Tests from a Testable Model in the Context of Domain Engineering
Authors: Soheila Bashardoust-Tajali, Jean-Pierre Corriveau
Venue: Proceedings of the 13th IEEE International Conference on on Engineering of Complex Computer Systems (2008)

Software testing is the traditional way to verify the functionality of a given software system against its requirements. In domain engineering, these requirements consist of variabilities and commonalities observed in a domain and captured in a domain model [5]. We remark that the latter may be used to obtain an elaborate design; however tests cannot be derived from it. This observation proceeds from the fact that testing techniques relevant to single-system engineering cannot deal with the variability intrinsic to a domain. Therefore, in the context of domain engineering, we claim that there is a need for a new modeling approach enabling domain testing. We have proposed elsewhere [1, 3, 4] a testable [2] domain model (based on the domain requirements) that takes the form of generative contracts. In this paper, we present a test extraction technique applicable to this testable model. This technique generates tests for validating behavioural aspects of an implemented member of the domain against that member’s requirements. That is, upon selecting a specific member to test, the variability of domain tests is eliminated, resulting in member-specific tests, which are to be bound to artefacts of that member’s corresponding implementation in order to obtain executable tests for this member. A case study on a domain-specific testable model will illustrate the steps of our proposed test extraction technique.
Computer Supported Ubiquitous Learning: Augmenting Learning Experiences in the Real World
Authors: Hiroaki Ogata
Venue: Proceedings of the Fifth IEEE International Conference on Wireless, Mobile, and Ubiquitous Technology in Education (2008)

This paper describes the design and the use of computer supported ubiquitous learning environments. First, this paper mentions context-aware language-learning support systems for learning vocabularies, mimicry and onomatopoeia, polite expressions, and conversational expressions by leveraging PDA, GPS, RFID tags and sensor networks. Second, it describes a web-based video repository for sharing and retrieving learning experiences. This system was used in the scenarios of computer hardware assembling and cooking. Finally, the paper is ended with the discussions and future works.