ppxscal/embedding_network huggingface dataset:
Analysis of series-coupled racetrack microring resonator arrays with DNA-CTMA
Authors: Jun Zhou, Zhenyong Wang, E. Y. B. Pun
Venue: Proceedings of the 2008 International Conference on Advanced Infocomm Technology (2008)

A novel design of series-coupled racetrack microring resonator arrays with DNA-CTMA is proposed and analyzed. By employing the coupled mode theory and transfer matrix method, the analytical expressions for their output transmission spectrum are deduced. Based on the analysis an optimum series-coupled racetrack microring resonator array with DNA-CTMA is designed. The effects of coupling coefficients on the transmission spectrum are investigated in details and box-like output transmission spectrum is obtained through the optimization of the coupling coefficients and the number of racetrack rings.
Reoptimization of Weighted Graph and Covering Problems
Authors: Davide Bilò, Peter Widmayer, Anna Zych
Venue: Approximation and Online Algorithms: 6th International Workshop, WAOA 2008, Karlsruhe, Germany, September 18-19, 2008. Revised Papers (2009)

Given an instance of an optimization problem and a good solution of that instance, the reoptimization is a concept of analyzing how does the solution change when the instance is locally modified. We investigate reoptimization of the following problems: Maximum Weighted Independent Set, Maximum Weighted Clique, Minimum Weighted Dominating Set, Minimum Weighted Set Cover and Minimum Weighted Vertex Cover. The local modifications we consider are addition or removal of a constant number of edges to the graph, or elements to the covering sets in case of Set Cover problem. We present the following results: 1 We provide a PTAS for reoptimization of the unweighted versions of the aforementioned problems when the input solution is optimal. 1 We provide two general techniques for analyzing approximation ratio of the weighted reoptimization problems. 1 We apply our techniques to reoptimization of the considered optimization problems and obtain tight approximation ratios in all the cases.
The Development Analysis of PHS in China
Authors: Shen Yan, Li Shiming
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 01 (2009)

This paper, based on the background analysis of how Personal Handy-phone System (PHS) comes into existence, compares its development from its marketability, sustainability and profitability. The research shows that PHS is very popular among the public and it develops very fast due to its 'mobility' and low charges. With the intensifying competition and decreasing input by Fixed Phone Operators (FPOs), its development is on the wane, thus affecting its sustainability. Seen from its economic values, PHS, up to now, still hasn't turned losses to profits. However, as the jetton for FPOs to get the 3G license, it brings about long-term potential revenues while improving its subscribers' welfare, thus its economic values can be better embodied in terms of its social values and option values.
End-User Development for E-Government Website Content Creation
Authors: Daniela Fogli
Venue: Proceedings of the 2nd International Symposium on End-User Development (2009)

E-government websites are currently becoming more and more huge and complex. They provide citizens with several kinds of information, including services for online task payment or front office reservation. The creation and maintenance of such websites often require a distributed approach: the content publication task is transferred from software developers to personnel of the various organization departments (here called the publishers). To this end, a Content Management System (CMS) is usually adopted. However, CMSs do not generally satisfy all requirements and needs that emerge in this application domain. Therefore, the adoption of End-User Development (EUD) techniques, tailored to the publishers' culture, background and skills, represents a possible solution to CMSs' current limitations. In this paper, after discussing the context and the existing problems, we describe an approach to extending CMSs with EUD techniques. The approach will be discussed with reference to the creation and maintenance of the website of an existing government agency.
Optimizing the data warehouse design by hierarchical denormalizing
Authors: Morteza Zaker, Somnuk Phon-Amnuaisuk, Su-Cheng Haw
Venue: Proceedings of the 8th conference on Applied computer scince (2008)

Data normalization and denormalization processes are common in database design community as these processes have a great impact on the underlying performance. Current data warehouse queries involve a set of aggregations and joining operations. Thus, normalization process is not a good choice as many relations need to be merged in order to answer queries involving aggregation. On the other hand, denormalization process engages a lot of administrative task. This task takes into account the documentation structure of the denormalization assessments, data validation, schedule of migrating of data and so on. In this paper, we show that the mentioned justifications can not be convincible reasons, under certain circumstances, to ignore the effects of denormalization. Until now denormalization techniques have been introduced for various types of database design. One of the techniques is hierarchical denormalization. Our experimental results indicate that the query response time is significantly decreased when the schema is deployed by hierarchical denormalization on a large dataset with multibillion records. Thus, we suggest that hierarchical denormalization could be considered as a fundamental method to enhance query processing performance.
Investigation of Ant System parameter interactions by using design of experiments for job-shop scheduling problems
Authors: Nilgün Fığlalı, Celal Özkale, Orhan Engin, Alpaslan Fığlalı
Venue: Computers and Industrial Engineering (2009)

In recent years, one of the most important and promising research fields has been metaheuristics to find optimal or near-optimal solutions for NP-hard combinatorial optimization problems. Improving the quality of the solution or the solution time is basic research area on metaheuristics. Modifications of the existing ones or creation of hybrid approaches are the focus of these efforts. Another area of improving the solution quality of metaheuristics is finding the optimal combination of algorithm control parameters. This is usually done by design of experiments or one-at-a-time approach in genetic algorithms, simulated annealing and similar metaheuristics. We observe that, in studies which use Ant Colonies Optimization (ACO) as an optimization technique; the levels of control parameters are determined by some non-systematic initial experiments and the interactions of the parameters are not studied yet. In this study, the parameters of Ant System have been investigated on different sized and randomly generated job-shop scheduling problems by using design of experiments. The effects and interactions of the parameters have been interpreted with the outputs of the experiments. Referring to the statistical analysis it is observed that none of the interactions between the Ant System parameters has a significant effect on makespan value. A specific fractional experimental design is suggested instead of the full factorial design. Depending on the findings from the benchmark problems it will be a reliable approach to use the suggested design for saving time and effort in experiments without sacrificing the solution quality.
Manufacturing enterprise collaboration based on a goal-oriented fuzzy trust evaluation model in a virtual enterprise
Authors: Jungtae Mun, Moonsoo Shin, Kyunghuy Lee, Mooyoung Jung
Venue: Computers and Industrial Engineering (2009)

To cope with the rapidly changing manufacturing environment, enterprise collaboration is getting increasingly more attention than ever before. The virtual enterprise (VE) is a concept that supports temporary alliances of manufacturing enterprises that have various collaboration models, such as extended enterprise, networked enterprise, concurrent enterprise, etc. Selection of trustworthy partners and trust building are important in virtual domains because they have largely been affecting the success of a VE. However, because of its complexity of trust, trust models in the literature are limited in their ability to cope with dynamic and virtual environment. In this paper, we propose a trust evaluation method of supporting enterprise collaboration and maximizing the satisfaction of cooperation. In this context, trust means the goal achievement probability. Trust value of an enterprise can be obtained by a fuzzy inference system whose rule-base is based on the top-level goal of a VE. According to the selector's preference, various rules can be applied to trust evaluation. For further study, the planning and scheduling problems should be considered along with the trust-based partner selection for collaboration among manufacturing enterprises.
Introduction to the special issue on teaching and learning in information retrieval
Authors: Juan M. Fernández-Luna, Juan F. Huete, Andrew Macfarlane
Venue: Information Retrieval (2009)

We present an overview of the special issue in this paper. The main objective is to provide information for lecturers on how to improve the student experience, using current knowledge in the field. To this end we present an overview of six papers covering areas as diverse as tools and methods used to support teaching and learning, pedagogical challenges in teaching mathematics for search, etc.
Parallel thinking
Authors: Guy E. Blelloch
Venue: Proceedings of the 14th ACM SIGPLAN symposium on Principles and practice of parallel programming (2009)

Assuming that the multicore revolution plays out the way the microprocessor industry expects, it seems that within a decade most programming will involve parallelism at some level. One needs to ask how this affects the the way we teach computer science, or even how we have people think about computation. With regards to teaching there seem to be three basic choices: (1) we only train a small number of experts in parallel computation who develop a collection of libraries, and everyone else just uses them; (2) we leave our core curriculum pretty much as is, but add some advanced courses on parallelism or perhaps tack on a few lectures at the end of existing courses; or (3) we start teaching parallelism from the start and embed it throughout the curriculum with the idea of getting students to think about parallelism as the most natural form of computation and sequential computation as a special case. This talk will examine some of the implications of the third option. It will argue that thinking about parallelism, when treated in an appropriate way, might be as easy or easier that thinking sequentially. A key prerequisite, however, is to identify what the core ideas in parallelism are and how they might be layered and integrated with existing concepts. Another more difficult issue is how to cleanly integrate these ideas among courses. After all much of the success of sequential computation follows from the concept of a random access machine and its ability to serve as a simple, albeit imperfect, interface between programming languages, algorithm analysis, and hardware design. The talk will go through an initial list of some core ideas in parallelism, and an approach to integrating these ideas between parallel algorithms, programming languages, and, to some extent, hardware. This requires, however, moving away from the concept of a machine model as a interface for thinking about computation.
The reality of Mathematics
Authors: Panos A. Ligomenides
Venue: Journal of Computational and Applied Mathematics (2009)

The power of mathematics is discussed as a way of expressing reasoning, aesthetics and insight in symbolic non-verbal communication. The human culture of discovering mathematical ways of thinking in the enterprise of exploring the understanding of the nature and the evolution of our world through hypotheses, theories and experimental affirmation of the scientific notion of algorithmic and non-algorithmic 'computation', is examined and commended upon.
Agent-Community-based P2P semantic MyPortal information retrieval system architecture
Authors: Haibo Yu, Tsunenori Mine, Makoto Amamiya
Venue: Journal of Embedded Computing (2009)

In this paper, we propose a conceptual architecture for a personal semantic Web information retrieval system. It incorporates semantic Web, Web service, P2P and multi-agent technologies to enable not only precise location of Web resources but also the automatic or semi-automatic integration of Web resources delivered through Web contents and Web services. In this architecture, the semantic issues concerning the whole lifecycle of information retrieval were considered consistently and the integration of Web contents and Web services is enabled seamlessly. The architecture consists of three main components: consumer, provider and mediator. All providers and consumers are constructed as semantic "MyPortal" which provides a gateway to all the information relevant to a user. Each provider describes its capabilities in what we call a WSCD (Web site capability description), and each consumer will submit relevant queries based on user requirements when a Web search is necessary. The mediator is composed of agents assigned to the consumer and providers using an Agent-Community-based P2P information retrieval (ACP2P) method to fullfill the information sharing among semantic MyPortals. Some preliminary experimental results are presented to show the efficiency of the ACP2P method and the usefulness of two query/response histories for looking up new information sources and for reducing communication loads.
A method for one port and two-port RC circuit synthesis
Authors: F. Constantinescu, M. Nitescu, Al. G. Gheorghe, C. V. Marin
Venue: Proceedings of the 7th conference on Circuits, systems, electronics, control and signal processing (2008)

A new method for the synthesis of RC one ports and two-ports is proposed in this paper. A new model of the human body, computed using this method, is developed. This model proves to be more accurate than the classical Cole model. The proposed synthesis method can be used to compute reduced order models (ROM), preserving the circuit passivity, unlike most known ROM computation methods.
Automated review of natural language requirements documents: generating useful warnings with user-extensible glossaries driving a simple state machine
Authors: Prateek Jain, Kunal Verma, Alex Kass, Reymonrod G. Vasquez
Venue: Proceedings of the 2nd India software engineering conference (2009)

We present an approach to automating some of the quality assurance review of software requirements documents, and promoting best practices for requirements documentation. The system we describe -- the Requirements Analysis Tool (RAT) - has been deployed and is currently being used in pilot projects with large and complex requirements documents. Preliminary results indicate a reduction in time needed to review documents and reduction in requirements defects as well as a change in the way users think about writing requirements. Our approach allows users to write requirements in natural language instead of an artificial formalism. RAT enforces requirements documentation best practices such as using standardized syntaxes and internally-consistent use of terminology. It supports the use of user-extensible glossaries to define terms. The formalism driving RAT is a state-machine, which is used to classify requirements into types based on keywords and then verify that the requirements follow one of the best practice syntaxes supported by the tool. It generates helpful warning messages explaining where requirements are not following best practices and suggests ways to rectify.
IBMon: monitoring VMM-bypass capable InfiniBand devices using memory introspection
Authors: Adit Ranadive, Ada Gavrilovska, Karsten Schwan
Venue: Proceedings of the 3rd ACM Workshop on System-level Virtualization for High Performance Computing (2009)

Active monitoring of virtual machine (VM) behaviors and their utilization of different resource types is critical for effective management of high end cluster machines, data centers, and cloud computing infrastructures. Unfortunately, for reasons of performance, certain types of existing and future devices support capabilities that provide VMs with direct access to device resources, thereby bypassing the virtual machine monitor (VMM). This presents significant challenges to the VMM due to its resulting inability to assess VMdevice interactions. This paper describes a monitoring utility, IBMon, which enables the asynchronous monitoring of virtualized Infini-Band devices -- a sample VMM-bypass device heavily used in the HPC community. In the absence of adequate hardware supported monitoring information, IBMon uses dynamic memory introspection techniques to infer information regarding the VM-device interactions. Experimental results demonstrate that IBMon can asynchronously monitor VMM-bypass operations with acceptable accuracy, and negligible overheads, including for larger number of VMs, and for VMs with dynamic behavior patterns.
On shouting "Fire!": regulating decoupled communication in distributed systems
Authors: Takahiro Murata, Naftaly H. Minsky
Venue: Proceedings of the ACM/IFIP/USENIX 2003 International Conference on Middleware (2003)

Decoupled communication, which requires no direct association between the producers of information and its consumers -- as under the publish/subscribe (P/S) middleware -- is often essential for the integration of distributed and heterogeneous applications. But the indefinite, and potentially global, reach of decoupled communication -- the very reason for its power -- has a dark side, which may complicate the system using it, making it less predictable, more brittle, and less safe. Just think about the effect of shouting "fire" in a packed theatre, particularly, but not only, if it is a false alarm. It is our thesis that the inherent drawbacks of decoupled communication can be tamed by decentralized regulation of its use. We show how such regulation can be carried out scalably by means of a distributed control mechanism called Law-Governed Interaction (LGI), and a middleware called Moses that implements this mechanism. Along the way, we illustrate the importance of such regulation, and its effectiveness, by considering the treatment of alarms in a large hospital.
Weed Manager-A model-based decision support system for weed management in arable crops
Authors: D. J. Parsons, L. R. Benjamin, J. Clarke, D. Ginsburg, A. Mayes, A. E. Milne, D. J. Wilkinson
Venue: Computers and Electronics in Agriculture (2009)

Weed Manager is a model-based decision support system to assist arable farmers and advisers in weed control decisions on two time scales: within a single season and over several years in a rotation. The single season decision is supported by a wheat crop and annual weed growth simulation, with a multi-stage heuristic decision model. The rotational aspect uses a model of seed population dynamics, with decisions optimised using stochastic dynamic programming. Each time scale has its own user interface within a single program integrated into the ArableDS framework, which provides data sharing between several decision support modules. Weed Manager was used by about 100 farmers and consultants in the 2005-2006 and 2006-2007 seasons.
Image Retrieval by Elastic Matching of Shapes and Image Patterns
Venue: Proceedings of the 1996 International Conference on Multimedia Computing and Systems (1996)

In this paper we present a system for interactive image database retrieval, based on elastic template matching. The template can be both a 1D template modeling the contour of an object, and a 2D template modeling a part of an image with a significant grey level pattern. The retrieval process Is obtained as a continuous interaction by which the original query of the user can be refined or changed on the basis of the results provided by the system. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Challenged Networks: Protocol and Architectural Challenges in Delay andDisruption Tolerant Networks
Authors: Khaled A. Harras
Venue:  (2008)

The evolution of wireless devices, such as laptops,personal digital assistants (PDAs), and cell phones,has changed the way networking and communication areperceived. The growing dependence on these devices,along with the high mobility of users, has increasedthe need to be connected in all places at all times.This increase in user demand, along with theevolution of new applications such as satellitenetworks, sparse mobile networks, and remotedisconnected communities, has ultimately led to therise of the delay and disruption tolerant networks(DTNs) research area.The future of computer networks includes an Internetthat encompasses numerous heterogeneous networks,reaches out to the most remote areas, and providescommunication in the most extreme and unstableconditions. With such a vision, new problems withlarge complexities arise. Communication devices inthe future will be required to remain connecteddespite the rise of new challenges such as networkpartitioning, intermittent connectivity, largedelays, the high cost of infrastructure deployment,and the absence of an end-to-end path. This book isan initial attempt to address these challenges.
Image Edge Detection Based on Adaptive Selection the Value of Structure Element of Mathematical Morphology
Authors: Xiuli Wang
Venue: Proceedings of the 2009 International Conference on Electronic Computer Technology (2009)

Selecting an appropriate value of structure element is a difficulty in mathematical morphology area. This paper brings forward an adaptively optimizing algorithm for the values of structure elements using in image edge detection. It varies the values according to the changes of gradients of different areas in an image. The result demonstrates that this method performs better in enhancing image edge than ordinary structure elements.
On Simplifying Placement and Routing by Extending Coarse-Grained Reconfigurable Arrays with Omega Networks
Authors: Ricardo Ferreira, Alex Damiany, Julio Vendramini, Tiago Teixeira, João M. Cardoso
Venue: Proceedings of the 5th International Workshop on Reconfigurable Computing: Architectures, Tools and Applications (2009)

Most reconfigurable computing architectures suffer from computationally demanding Placement and Routing (P R) steps which might hamper their use in contexts requiring dynamic compilation (e.g., to guarantee application portability in embedded systems). Bearing in mind the simplification of P R steps, this paper presents and analyzes a coarse-grained reconfigurable array extended with global Omega Networks. We show that integrating one or two Omega Networks in a coarse-grained array simplifies the P R stage with both low hardware resource overhead and low performance degradation (18% for an 8×8 array). The experimental results included permit to compare the coarse-grained array with one or two Omega Networks with a coarse-grained array based on a grid of processing elements with neighbor connections. When comparing the execution time to perform the P R stage needed for the two arrays, we show that the array using two Omega Networks needs a far simple P R which for the benchmarks used completed on average in about 20× less time.