ppxscal/embedding_network huggingface dataset:
Does the lit-only restriction make any difference for the σ-game and σ+-game?
Authors: John Goldwasser, Xinmao Wang, Yaokun Wu
Venue: European Journal of Combinatorics (2009)

Each vertex in a simple graph is in one of two states: "on" or "off". The set of all on vertices is called a configuration. In the &sigma;-game, "pushing" a vertex v changes the state of all vertices in the open neighborhood of v, while in the &sigma;+-game pushing v changes the state of all vertices in its closed neighborhood. The reachability question for these two games is to decide whether a given configuration can be reached from a given starting configuration by a sequence of pushes. We consider the lit-only restriction on these two games where a vertex can be pushed only if it is in the on state. We show that the lit-only restriction can make a big difference for reachability in the &sigma;-game, but has essentially no effect in the &sigma;+-game.
Ambient pressure synthesis of nanostructured tungsten oxide crystalline films
Authors: H. X. Zhang, B. Q. Yang, P. X. Feng
Venue: Journal of Nanomaterials (2008)

We report the results of the ambient pressure synthesis of tungsten oxide nanowires and nanoparticles on AlN substrates using the hot filament CVD techniques. The morphologic surface, crystallographic structures, chemical compositions, and bond structures of the obtained samples have been investigated using scanning electron microscopy (SEM), X-ray diffraction (XRD), energy dispersive X-ray spectroscopy (EDX), and Raman scattering, respectively. Different morphologies were observed for different substrate temperatures, but otherwise identical growth conditions. The experimental measurements reveal the evolutions of the crystalline states and bond structures following the substrate temperatures. Besides, different substrate materials also affected the tungsten oxide nanostructures. Bundles of wire-type tungsten oxide nanowires with a length of up to 5mm were obtained on Al2O3 substrate. Furthermore, the sensitive properties of the super long nanowires to the gas and different temperature were investigated. The dependence of the sensitivity of tungsten oxide nanowires to the methane as a function of the time was obtained. The sensitive properties of the tungsten oxide nanowires have almost linear relationship with the temperature.
Eulerian detachments with local edge-connectivity
Authors: Takuro Fukunaga, Hiroshi Nagamochi
Venue: Discrete Applied Mathematics (2009)

For a graph G, a detachment operation at a vertex transforms the graph into a new graph by splitting the vertex into several vertices in such a way that the original graph can be obtained by contracting all the split vertices into a single vertex. A graph obtained from a given graph G by applying detachment operations at several vertices is called a detachment of graph G. While detachment operations may decrease the connectivity of graphs, there are several works on conditions for preserving the connectivity. In this paper, we present necessary and sufficient conditions for a given graph/digraph to have an Eulerian detachment that satisfies a given local edge-connectivity requirement. We also discuss conditions for the detachment to be loopless.
Holographic memories: fantasy or reality?
Authors: A. K. Gillis, G. E. Hoffmann, R. H. Nelson
Venue: Proceedings of the May 19-22, 1975, national computer conference and exposition (1975)

Twelve years have passed since Leith's historic paper which opened the era of modern holography. Although initially investigated for its unusual imaging properties, we have seen about five years of intensive research on the application of holography to digital data storage. Because of its unique properties, it is not surprising that attempts have been made to apply holography to such a broad range of memory and storage hierarchy. Activity has ranged from developing small-capacity, high-speed memories to large-capacity, read-only storage in the multiterabit range. Additionally, significant activity has been directed toward solving the highly specialized problems associated with ultra-high data rate recorders and reproducers. Memory systems are now, and will continue to be, the highest single cost item in the computer hardware structure. This, at least in part, accounts for the intensive research activity in optical alternatives to computer memory and storage.
Maximum Class Separability for Rough-Fuzzy C-Means Based Brain MR Image Segmentation
Authors: Pradipta Maji, Sankar K. Pal
Venue: Transactions on Rough Sets IX (2008)

Image segmentation is an indispensable process in the visualization of human tissues, particularly during clinical analysis of magnetic resonance (MR) images. In this paper, the rough-fuzzy c-means (RFCM) algorithm is presented for segmentation of brain MR images. The RFCM algorithm comprises a judicious integration of the rough sets, fuzzy sets, and c-means algorithm. While the concept of lower and upper approximations of rough sets deals with vagueness and incompleteness in class definition of brain MR images, the membership function of fuzzy sets enables efficient handling of overlapping classes. The crisp lower bound and fuzzy boundary of a class, introduced in the RFCM algorithm, enable efficient segmentation of brain MR images. One of the major issues of the RFCM based brain MR image segmentation is how to select initial prototypes of different classes or categories. The concept of discriminant analysis, based on the maximization of class separability, is used to circumvent the initialization and local minima problems of the RFCM. Some quantitative indices are introduced to extract local features of brain MR images for accurate segmentation. The effectiveness of the RFCM algorithm, along with a comparison with other related algorithms, is demonstrated on a set of brain MR images.
Authoring diagram-based CBA with CourseMarker
Authors: Colin A. Higgins, Brett Bligh, Pavlos Symeonidis, Athanasios Tsintsifas
Venue: Computers Education (2009)

The CourseMarker system has been used to assess free-response computer based assessment (CBA) exercises since 1998. The aim of the studies reported here was to evaluate the feasibility and usefulness of developing and deploying diagram-based exercises using DATsys, an authoring environment for diagram-based CBA, together with CourseMarker. Postgraduate students constructed diagram-based exercises in four domains. The process of constructing the exercises was captured as an indicator of feasibility. The exercises were then used to assess two cohorts of undergraduate students. Instruments including system submission logs and student questionnaires were used to assess usefulness. Findings indicate that there is considerable potential for the assessment of free-response domains such as diagrams. Such an approach can help students as part of an iterative process of learning by allowing repeated submission of coursework, which may be most appropriate within a formative assessment context. The exercises are popular with students and demonstrate a gradual, though decelerating, increase in marks over subsequent submissions. The techniques are reliable, but further development allowing for alternative model solutions and assessment of the aesthetic appearance of diagrams would increase validity. Our techniques and findings are novel for CBA, and have implications for the increasingly important research area of formative assessment.
FUN: Fast Discovery of Minimal Sets of Attributes Functionally Determining a Decision Attribute
Authors: Marzena Kryszkiewicz, Piotr Lasek
Venue: Transactions on Rough Sets IX (2008)

In this paper, we present our Fun algorithm for discovering minimal sets of conditional attributes functionally determining a given dependent attribute. In particular, the algorithm is capable of discovering Rough Sets certain, generalized decision, and membership distribution reducts. Fun can operate either on partitions of objects or alternatively on stripped partitions, which do not store singleton groups. It is capable of using functional dependencies occurring among conditional attributes for pruning candidate dependencies. In this paper, we offer further reduction of stripped partitions, which allows correct determination of minimal functional dependencies provided optional candidate pruning is not carried out. In the paper we consider six variants of Fun, including two new variants using reduced stripped partitions. We have carried out a number of experiments on benchmark data sets to test the efficiency of all variants of Fun. We have also tested the efficiency of the Fun's variants against the Rosetta and RSES toolkits' algorithms computing all reducts and against Tane, which is one of the most efficient algorithms computing all minimal functional dependencies. The experiments prove that Fun is up to 3 orders of magnitude faster than the the Rosetta and RSES toolkits' algorithms and faster than Tane up to 30 times.
A comparison of two approaches for solving unconstrained influence diagrams
Authors: Kristian S. Ahlmann-Ohlsen, Finn V. Jensen, Thomas D. Nielsen, Ole Pedersen, Marta Vomlelová
Venue: International Journal of Approximate Reasoning (2009)

Influence diagrams and decision trees represent the two most common frameworks for specifying and solving decision problems. As modeling languages, both of these frameworks require that the decision analyst specifies all possible sequences of observations and decisions (in influence diagrams, this requirement corresponds to the constraint that the decisions should be temporarily linearly ordered). Recently, the unconstrained influence diagram was proposed to address this drawback. In this framework, we may have a partial ordering of the decisions, and a solution to the decision problem therefore consists not only of a decision policy for the various decisions, but also of a conditional specification of what to do next. Relative to the complexity of solving an influence diagram, finding a solution to an unconstrained influence diagram may be computationally very demanding w.r.t. both time and space. Hence, there is a need for efficient algorithms that can deal with (and take advantage of) the idiosyncrasies of the language. In this paper we propose two such solution algorithms. One resembles the variable elimination technique from influence diagrams, whereas the other is based on conditioning and supports any-space inference. Finally, we present an empirical comparison of the proposed methods.
The homological reduction method for computing cocyclic Hadamard matrices
Authors: V. Alvarez, J. A. Armario, M. D. Frau, P. Real
Venue: Journal of Symbolic Computation (2009)

An alternate method for constructing (Hadamard) cocyclic matrices over a finite group G is described. Provided that a homological model for G is known, the homological reduction method automatically generates a full basis for 2-cocycles over G (including 2-coboundaries). From these data, either an exhaustive or a heuristic search for Hadamard cocyclic matrices is then developed. The knowledge of an explicit basis for 2-cocycles which includes 2-coboundaries is a key point for the designing of the heuristic search. It is worth noting that some Hadamard cocyclic matrices have been obtained over groups G for which the exhaustive searching techniques are not feasible. From the computational-cost point of view, even in the case that the calculation of such a homological model is also included, comparison with other methods in the literature shows that the homological reduction method drastically reduces the required computing time of the operations involved, so that even exhaustive searches succeeded at orders for which previous calculations could not be completed. With aid of an implementation of the method in MATHEMATICA, some examples are discussed, including the case of very well-known groups (finite abelian groups, dihedral groups) for clarity.
The specification of the language of the field and interoperability: cross-language access to catalogues and online libraries (CACAO)
Authors: Barbara Levergood, Stefan Farrenkopf, Elisabeth Frasnelli
Venue: Proceedings of the 2008 International Conference on Dublin Core and Metadata Applications (2008)

The CACAO Project (Cross-language Access to Catalogues and Online Libraries) has been designed to implement natural language processing and cross-language information retrieval techniques to provide cross-language access to information in libraries, a critical issue in the linguistically diverse European Union. This project report addresses two metadata-related challenges for the library community in this context: "false friends" (identical words having different meanings in different languages) and term ambiguity. The possible solutions involve enriching the metadata with attributes specifying language or the source authority file, or associating potential search terms to classes in a classification system. The European Library will evaluate an early implementation of this work in late 2008.
The eBayers Guide to the Galaxy Color Edition for Ebay Business Advertising & Online Marketing: The must have eBay Marketing & Advertising book for Buyers & Sellers
Authors: Harry J. Misner
Venue:  (2008)

This eBay guide was written to give you the basics needed to be a successful Buyer or Seller on eBay. EBay can be a great alternative Web Marketing, Computer & Internet Advertising, or Online Promotion tool. So no matter what Industry or Profession you're in, eBay can be a great asset to small businesses or inspired entrepreneurs everywhere. Online auctions can improve entrepreneurship which in turn will improve the business culture of companies big & small.
Adaptable evaluation approach for software architecture
Authors: Olfa Lamouchi, Amar Ramdan-Cherif, Nicole Levy
Venue: Proceedings of the 9th International Conference on Computer Systems and Technologies and Workshop for PhD Students in Computing (2008)

The aim of this paper is to present a new approach for direct evaluation of the quality of software architecture. In this evaluation approach criteria interdependences can be managed and an indication of overall quality can be determined using a fuzzy engine. The evaluation process is based on a quality model, metric model and a set of evaluation methods. In each evaluation method a set of basic and optional evaluation scenarios is developed to show the suitability of our approach to many architectures.
Variance Minimization Least Squares Support Vector Machines for Time Series Analysis
Authors: Róbert Ormándi
Venue: Proceedings of the 2008 Eighth IEEE International Conference on Data Mining (2008)

Here we propose a novel machine learning method for time series forecasting which is based on the widely-used Least Squares Support Vector Machine (LS-SVM) approach. The objective function of our method contains a weighted variance minimization part as well. This modification makes the method more efficient in time series forecasting, as this paper will show. The proposed method is a generalization of the well-known LS-SVM algorithm. It has similar advantages like the applicability of the kernel-trick, it has a linear and unique solution, and a short computational time, but can perform better in certain scenarios. The main purpose of this paper is to introduce the novel Variance Minimization Least Squares Support Vector Machine (VMLS-SVM) method and to show its superiority through experimental results using standard benchmark time series prediction datasets.
Design of mobile wellness applications: identifying cross-cultural factors
Authors: Aino Ahtinen, Shruti Ramiah, Jan Blom, Minna Isomursu
Venue: Proceedings of the 20th Australasian Conference on Computer-Human Interaction: Designing for Habitus and Habitat (2008)

This paper explores the design of mobile applications for supporting wellness activities. A cross-cultural user study was conducted in India and Finland. 16 participants used a technology probe (a mobile application called Wellness Diary) for the duration of two weeks. The focus of the study was to identify design factors that need to be considered when designing culturally sensitive mobile wellness applications. The findings are based on the subjective user experience reported by the participants, data collected with the technology probe, and ideas and needs of the participants that surfaced during the study. Results show that both cultural and environmental factors affect the needs towards the wellness application and usage of it. Differences were identified, for example, in how users defined wellness, what wellness concerns they had, attitudes towards setting goals, and how built and natural environments affected wellness activities.
Implementation Aspects of Mobile and Embedded Trusted Computing
Authors: Kurt Dietrich, Johannes Winter
Venue: Proceedings of the 2nd International Conference on Trusted Computing (2009)

Nowadays, trusted platform modules (TPMs) are usually deployed together with desktop PCs and notebooks. However, these platforms are not the only ones that can host TPMs. Mobile and embedded platforms like cell phones can also host TPMs but may have different requirements and different use-case scenarios. In contrast to common TPMs, TPMs for mobile platforms do not need to be implemented as micro controllers, leading to different security assumptions. In order to find these differences, we have designed and implemented two approaches for mobile TPMs that are analyzed in detail in the context of this paper.
Supporting QoS-Based Discovery for Visualization Web Services
Authors: Gao Shu, Xiuming Chu, Dingfang Chen
Venue: International Journal of Distributed Sensor Networks (2009)

Collaborative and distributed visualization applications generally require access to high-performance and high-end resources that are both expensive to own and maintain. Often there are also a limited number of such resources available. The development of Grid infrastructure allows these resources to be shared by visualization service providers and users. However, effective use of such resources necessitate the development of mechanisms which take into account the particular constraints needed to satisfy particular application resource demands as some visualization applications may be dependent on requiring data to be stored and delivered in a timely manner. Therefore, these applications must adhere to stringent real-time constraints and Quality-of-Service (QoS) requirements. In this paper we proposed a novel approach to matching visualization service requests with service advertisements using QoS attributes. Five attributes—Response time, Availability, Execution price, Memory capacity, and Number of CPUs—are selected as the quality criteria for the visualization services, and for each one, we provide a definition, indicate its granularity, and provide rules to compute its value for a given service. The idea behind QoS-based matchmaking for visualization is an attempt to provide visualization service requesters with an approach to locate services, which have been selected by function properties, utilizing non-functional properties in order to get “good” quality services. The matchmaking approach proposed is concerned with computing the similarity between service requests and services based on above QoS attributes. The paper gives the equations of the similarities for Response time, Availability, Execution price, Memory capacity, Number of CPUs, and details the matching algorithm based on these equations for similarity. A prototype of the visualization service discovery system was developed, which is based on QoS and extends our previous prototype of the semantic portal for the discovery of the visualization service which provides multiple techniques to search available visualization services. But these techniques are all based on functional attributes, not on QoS ones. The enhanced system introduces the computation of QoS similarity and the capability of QoS feedback to users, which will be faster in finding qualified visualization Web Services. The paper discusses the prototype's architecture and how it works. The paper finally presents an experiment, the objective of which is to observe the performance of the search with QoS attributes. It can be seen from the experiment that the time for QoS matching is acceptable, and the search based on nonfunctional attributes allows the user to locate more appropriate visualization Web Services.
A common framework for lattice-valued uniform spaces and probabilistic uniform limit spaces
Authors: Andrew Craig, Gunther Jäger
Venue: Fuzzy Sets and Systems (2009)

We study a category of lattice-valued uniform convergence spaces where the lattice is enriched by two algebraic operations. This general setting allows us to view the category of lattice-valued uniform spaces as a reflective subcategory of our category, and the category of probabilistic uniform limit spaces as a coreflective subcategory.
An LMI Approach to Mixed H2/H8 Synthesis via Dynamic Output-Feedback for Active Magnetic Bearing
Authors: Fatemeh Jamshidi, Mehdi Ghasem Moghadam, Mohammad T. H. Beheshti
Venue: Proceedings of the 2009 International Conference on Advanced Computer Control (2009)

This paper considers the robust control of an active radial magnetic bearing system, having a homopolar, external rotor topology, which is used to support an annular fiber composite flywheel rim. A second-order dynamical compensator is used for control, its design being based on a linearized one-dimensional model which is treated as an interval system in order to cope with parameter uncertainties. We formulate a problem of multiobjective dynamic output feedback synthesis which incorporate nominal H2 and H∞ performances. Simulation results demonstrate both stability and performance robustness of the developed controller.
Using clustering technique M-PAM in mobile network planning
Authors: Lamiaa Fattouh Ibrahim, Manal Hamed Al Harbi
Venue: Proceedings of the 12th WSEAS international conference on Computers (2008)

Network planning is a key importance to obtain a good functionality, price and quality of services of a network. With the rapid development in mobile network we need effective network planning tool to satisfy the need of customers. However, deciding upon the optimum placement for the base stations (BS's) to achieve best services while reducing the cost is a complex task requiring vast computational resource. This paper addresses antenna placement problem or the cell planning problem, involves locating and configuring infrastructure for mobile networks by modified the original Partitioning Around Medoids PAM algorithm. M-PAM (Modified-Partitioning Around Medoids) has been proposed to satisfy the requirements and constraints. PAM needs to specify number of clusters (k) before starting to search for the best locations of base stations. The M-PAM algorithm uses the radio network planning to determine k. We calculate for each cluster its coverage and capacity and determine if they satisfy the mobile requirements, if not we will increase (k) and reapply algorithms depending on two methods for clustering. Implementation of this algorithm to a real case study is presented. Experimental results and analysis indicate that the M-PAM algorithm when applying method two is effective in case of heavy load distribution, and leads to minimum number of base stations, which directly affected onto the cost of planning the network.
Properties of a Convoluted-Time and Code Division Multiple Access Communication Systems Based upon Complete Complementary Codes
Authors: Tetsuya Kojima, Masahiro Aono
Venue: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (2008)

A convoluted-time and code division multiple access (CT-CDMA) communication system based on complete complementary codes has been proposed. In this letter, the properties of this communication system are discussed and compared with those of the conventional CDMA systems using complete complementary codes.