ppxscal/embedding_network huggingface dataset:
Routing in Outer Space: Fair Traffic Load in Multihop Wireless Networks
Authors: Alessandro Mei, Julinda Stefa
Venue: IEEE Transactions on Computers (2009)

In this paper, we consider security-related and energy efficiency issues in multihop wireless networks. We start our work from the observation, known in the literature, that shortest path routing creates congested areas in multihop wireless networks. These areas are critical—they generate both security and energy efficiency issues. We attack these problems and set out routing in outer space, a new routing mechanism that transforms any shortest path routing protocol (or approximated versions of it) into a new protocol that does not create congested areas, does not have the associated security-related issues, and does not encourage selfish positioning. Moreover, the network is more energy efficient than the same network using the original routing protocol (in spite of using more energy globally) and dies more gracefully. We also describe applications of our idea to mobility and to a security protocol for the detection of node replication attacks.
Towards a Complete Ontology-Aware Authoring Tool for Collaborative Learning
Authors: Seiji Isotani, Riichiro Mizoguchi
Venue: Proceeding of the 2007 conference on Supporting Learning Flow through Integrative Technologies (2007)

In this paper we briefly describe our work pointing out important research subjects during the development of intelligent educational systems for collaborative learning (CL). Our goal is to develop an ontology-aware authoring system for CL based on a well-grounded theoretical knowledge.
Improving inventory control for SABIC products
Authors: Zaid T. Balkhi, Abdelaziz Foul
Venue: Proceedings of the 15th american conference on Applied mathematics (2009)

The Saudi Basic Industries Corporation (SABIC) is one of the world's leading manufacturers of fertilizers, plastics, chemicals and metals. It supplies these products to many countries over all the world. As a result, SABIC needs to store its products for certain periods of time while these products are waiting to be delivered to clients in Saudi Arabia or to be exported abroad. Because of the great need to improve inventory control for SABIC products, the present research was carried out. The problem we consider for such giant systems is considered within a given time horizon which consists of different time periods. Production, demand, and deterioration rates in each period and for each product are known. Shortage for each product is allowed but it is completely backlogged. The objective is to find the optimal production and restarting times for each product in each period so that the overall total inventory cost for all products is minimized. In this paper, a formulation of the problem is developed and optimization techniques are performed to show uniqueness and global optimality of the solution.
Combining frequency and time domain approaches to systems with multiple spike train input and output
Authors: D. R. Brillinger, K. A. Lindsay, J. R. Rosenberg
Venue: Biological Cybernetics (2009)

A frequency domain approach and a time domain approach have been combined in an investigation of the behaviour of the primary and secondary endings of an isolated muscle spindle in response to the activity of two static fusimotor axons when the parent muscle is held at a fixed length and when it is subjected to random length changes. The frequency domain analysis has an associated error process which provides a measure of how well the input processes can be used to predict the output processes and is also used to specify how the interactions between the recorded processes contribute to this error. Without assuming stationarity of the input, the time domain approach uses a sequence of probability models of increasing complexity in which the number of input processes to the model is progressively increased. This feature of the time domain approach was used to identify a preferred direction of interaction between the processes underlying the generation of the activity of the primary and secondary endings. In the presence of fusimotor activity and dynamic length changes imposed on the muscle, it was shown that the activity of the primary and secondary endings carried different information about the effects of the inputs imposed on the muscle spindle. The results presented in this work emphasise that the analysis of the behaviour of complex systems benefits from a combination of frequency and time domain methods.
Differentially private recommender systems: building privacy into the net
Authors: Frank McSherry, Ilya Mironov
Venue: Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining (2009)

We consider the problem of producing recommendations from collective user behavior while simultaneously providing guarantees of privacy for these users. Specifically, we consider the Netflix Prize data set, and its leading algorithms, adapted to the framework of differential privacy. Unlike prior privacy work concerned with cryptographically securing the computation of recommendations, differential privacy constrains a computation in a way that precludes any inference about the underlying records from its output. Such algorithms necessarily introduce uncertainty--i.e., noise--to computations, trading accuracy for privacy. We find that several of the leading approaches in the Netflix Prize competition can be adapted to provide differential privacy, without significantly degrading their accuracy. To adapt these algorithms, we explicitly factor them into two parts, an aggregation/learning phase that can be performed with differential privacy guarantees, and an individual recommendation phase that uses the learned correlations and an individual's data to provide personalized recommendations. The adaptations are non-trivial, and involve both careful analysis of the per-record sensitivity of the algorithms to calibrate noise, as well as new post-processing steps to mitigate the impact of this noise. We measure the empirical trade-off between accuracy and privacy in these adaptations, and find that we can provide non-trivial formal privacy guarantees while still outperforming the Cinematch baseline Netflix provides.
Data integration in mashups
Authors: Giusy Di Lorenzo, Hakim Hacid, Hye-young Paik, Boualem Benatallah
Venue: ACM SIGMOD Record (2009)

Mashup is a new application development approach that allows users to aggregate multiple services to create a service for a new purpose. Even if the Mashup approach opens new and broader opportunities for data/service consumers, the development process still requires the users to know not only how to write code using programming languages, but also how to use the different Web APIs from different services. In order to solve this problem, there is increasing effort put into developing tools which are designed to support users with little programming knowledge in Mashup applications development. The objective of this study is to analyze the richnesses and weaknesses of the Mashup tools with respect to the data integration aspect.
Triplet-based topology for on-chip networks
Authors: Wang Zuo, Zuo Qi, Li Jiaxin
Venue: WSEAS Transactions on Computers (2009)

Most CMPs use on-chip network to connect cores and tend to integrate more simple cores on a single die. As the number of cores increases, on-chip network will play an important role in the performance of future CMPs. Due to the tradeoff between the performance and area constraint in on-chip network designs, we propose the use of triplet-based topology in on-chip interconnection networks and demonstrate how a 9-node triplet-based topology can be mapped to on-chip network. By using group-caching protocol to exploit traffic locality, triplet-based topology achieve lower latency and energy consumption than 2D-MESH. We run multithreaded commercial benchmarks on multi-core simulator GEMS to generate practical traffics and simulate these traffics on network simulator Garnet. Our experiment results show that triplet-based network can increase the work-related throughput by 3%-11% and reduce average network latency by 24%-32% compared with 2D-MESH, with the router energy consumption reduced by 13%-16% and the link energy consumption reduced by 14%-16%.
Pressure corrected SPH for fluid animation
Authors: Kai Bao, Hui Zhang, Lili Zheng, Enhua Wu
Venue: Computer Animation and Virtual Worlds (2009)

We present a novel pressure correction scheme for the Smoothed Particle Hydrodynamics (SPH) for fluid animation. In the conventional SPH method, equations of state (EOS) are employed to relate the pressure to the particle density. To enforce the volume conservation, high speeds of sound are usually required, which leads to very small time steps and noisy pressure distribution. The problem remains one of the main reasons of numerical instability in SPH. In the paper, a new extra pressure correction scheme is proposed to transport the local pressure disturbance to the neighboring area and no solution of the Poisson equation is required. As a result, smoother pressure distribution and more efficient simulation are achieved. The proposed method has been used to simulate free surface problems. The results demonstrate the validation of the present SPH method. Surface tension and fluid fragmentation can be well handled. Copyright &copy; 2009 John Wiley & Sons, Ltd. A novel pressure correction scheme is proposed to be used along with the equations of state in SPH. With the pressure correction, the local pressure disturbance is transported to the neighboring area and more accurate and efficient fluid simulation is achieved.
Need to consider variations within demographic groups when evaluating educational interventions
Authors: Amruth N. Kumar
Venue: Proceedings of the 14th annual ACM SIGCSE conference on Innovation and technology in computer science education (2009)

Traditionally, educational interventions in Computer Science have been studied for their effect on entire classes, or specific demographic groups. But, in our studies, we have found that often, significant interactions exist among demographic groups. Treating demographic groups as homogeneous groups when evaluating educational interventions in Computer Science could miss subtle interactions among the groups.
Web service-driven framework for maintaining global version consistency in distributed enterprise portal
Authors: Hui-Ling Lin, Shao-Shin Hung, Derchian Tsaih, Chiehyao Chang
Venue: WSEAS Transactions on Computers (2009)

The explosion of the web has led to a situation where a majority of the traffic on the Internet is web related. Today, practically all of the popular web sites arc served from single locations. This necessitates frequent long distance network transfers of data (potentially repeatedly) which results in a high response time for users, and is wasteful of the available network bandwidth. This paper presents a new approach to web replication, where each of the replicas resides in a different part of the network, and the browser is automatically and transparently directed to the "best" server. This paper presents a transnational hierarchical global patch consistent model called THGPCM (Transnational Hierarchical Global Patch Consistent Model). Improving the OPDS (Original Patching Data Source) enabled network equipments, capable of updating patch parameter that existed in enterprise with specified OPDS partially dependency relationships. Apply scenario can reduce the global patch service cost of transnational enterprise network equipments and minimum the turnaround time of patch service delay.
Detecting semantic relations between named entities in text using contextual features
Authors: Toru Hirano, Yoshihiro Matsuo, Genichiro Kikui
Venue: Proceedings of the 45th Annual Meeting of the ACL on Interactive Poster and Demonstration Sessions (2007)

This paper proposes a supervised learning method for detecting a semantic relation between a given pair of named entities, which may be located in different sentences. The method employs newly introduced contextual features based on centering theory as well as conventional syntactic and word-based features. These features are organized as a tree structure and are fed into a boosting-based classification algorithm. Experimental results show the proposed method outperformed prior methods, and increased precision and recall by 4.4% and 6.7%.
A meta-model based approach to UML modelling and simulation
Authors: Arnis Kleins, Yuri Merkuryev, Artis Teilans, Maxim Filonik
Venue: Proceedings of the 7th WSEAS international conference on System science and simulation in engineering (2008)

This paper is devoted to a meta-model based approach to UML systems modelling and simulation. The approach allows creating a system model by operating with artefacts from the problem domain, followed by generation of a UML model. The discussed approach is illustrated by generating UML models, using Use Case and Activity diagrams of the UML language. As a novelty for UML modelling, especially for simulation purposes, the presented meta-model is enriched by a set of stochastic attributes of modelled activities. Such stochastic attributes are usable for further implementation of DEVS simulators.
Plenary lecture: analytical synthesis method - a new circuit design method for the challenge without trade-off
Authors: Chun-Ming Chang
Venue: Proceedings of the 8th WSEAS international conference on Electronics, hardware, wireless and optical communication (2009)

Analytical Synthesis Method (ASM) has been presented in several papers published in the IEEE Transactions on Circuits and Systems since 2003. It is one of the powerful design methods in the field of analog circuit design. It is the method using a succession of innovative algebra manipulation operations to decompose a complicated transfer function representing the relationship between the output and the input signals of a design project into many simple equations feasible by using the corresponding simple sub-circuitries. The simple sub-circuitries can be constructed by the desired configuration of the element such as the single-ended-input operational transconductance amplifiers (OTAs) and the grounded capacitors, both of which are used for absorbing and reducing the shunt parasitic capacitance and lead to have more precise output responses. In addition to this, the ASM can control the number of the terms in the complicated decomposition process such that the number of both active and passive components used in the circuit is the least compared to the previously reported ones. Then, the ASM is the only one method which can simultaneously achieve the three important criteria for the design of OTA-C circuits without trade-off. Due to the flexibility of the ASM, the simple sub-circuitries used in the circuit design can be changed and chosen according to different necessities for the target of the circuit design. For example, if the reduction of the number of the active and passive components used in the circuit is more important than the type of the element configurations like single-ended-input/differential-input OTAs and grounded/floating capacitors due to the consideration about power consumption, chip area, noise, and total parasitics......, etc., the minimum component OTA-C circuit can also be investigated and developed successfully using the ASMs. The fully flexible characteristic and the real demonstration in the literature of the ASM may make it be one of the most prospective methods in the field of analog circuit design in the near future.
ArsMeteo: artworks and tags floating over the planet art
Authors: Edoardo Acotto, Matteo Baldoni, Cristina Baroglio, Viviana Patti, Flavio Portis, Giorgio Vaccarino
Venue: Proceedings of the 20th ACM conference on Hypertext and hypermedia (2009)

In this paper we present ArsMeteo, a Web 2.0 portal for collecting and sharing digital (or digitalized) artworks, like videos, pictures, poems and music. The ArsMeteo contents are enriched with a variety of meanings by the tagging activity of all users of the community, both authors and visitors. In this setting, innovative artistic approaches to tagging and tag-based browsing has been thoughtin order to create a dynamic and fertile background for artistic experimentation and cooperative artistic creation.
The Fourier regularization for solving the Cauchy problem for the Helmholtz equation
Authors: Chu-Li Fu, Xiao-Li Feng, Zhi Qian
Venue: Applied Numerical Mathematics (2009)

The Cauchy problem for the Helmholtz equation in an infinite ''strip'' is considered. The Cauchy data are at the boundary x=0 given in an approximate manner and the solution is sought in the region {(x,y)|0=1}. This problem is severely ill-posed, i.e., the solution (if it exists) does not depend continuously on the data. In this paper we use the Fourier regularization method to solve the problem. The method is independent of the interval length and wave number. Some sharp error estimates between the exact solution and its regularization approximation are given and numerical examples show that the method works effectively.
Design of robust, energy-efficient full adders for deep-submicrometer design using hybrid-CMOS logic style
Authors: Sumeer Goel, Ashok Kumar, Magdy A. Bayoumi
Venue: IEEE Transactions on Very Large Scale Integration (VLSI) Systems (2006)

We present a new design for a 1-b full adder featuring hybrid-CMOS design style. The quest to achieve a good-drivability, noise-robustness, and low-energy operations for deep submicrometer guided our research to explore hybrid-CMOS style design. Hybrid-CMOS design style utilizes various CMOS logic style circuits to build new full adders with desired performance. This provides the designer a higher degree of design freedom to target a wide range of applications, thus significantly reducing design efforts. We also classify hybrid-CMOS full adders into three broad categories based upon their structure. Using this categorization, many full-adder designs can be conceived. We will present a new full-adder design belonging to one of the proposed categories. The new full adder is based on a novel XOR-XNOR circuit that generates XOR and XNOR full-swing outputs simultaneously. This circuit outperforms its counterparts showing 5%-37% improvement in the power-delay product (PDP). A novel hybrid-CMOS output stage that exploits the simultaneous XOR-XNOR signals is also proposed. This output stage provides good driving capability enabling cascading of adders without the need of buffer insertion between cascaded stages. There is approximately a 40% reduction in PDP when compared to its best counterpart. During our experimentations, we found out that many of the previously reported adders suffered from the problems of low swing and high noise when operated at low supply voltages. The proposed full adder is energy efficient and outperforms several standard full adders without trading off driving capability and reliability. The new full-adder circuit successfully operates at low voltages with excellent signal integrity and driving capability. To evaluate the performance of the new full adder in a real circuit, we embedded it in a 4-and 8-b, 4-operand carry-save array adder with final carry-propagate adder. The new adder displayed better performance as compared to the standard full adders.
Temporal Pattern Mining in Dynamic Environments
Authors: A. D. Lattner
Venue:  (2007)

Many domains feature a dynamic characteristic like logistics, sports, or medicine and it would be useful to learn about frequent patterns, e.g., in what situations a traffic jam is likely to happen. Additionally, we are facing complex situations with many objects and relations that might change over time. The learning approach developed in this work identifies frequent temporal patterns out of qualitative, interval-based descriptions of dynamic scenes by extending the Apriori algorithm and combining ideas from relational as well as sequential association rule mining approaches. Temporal relations in patterns are represented by qualitative interval relations as they have been introduced by Allen and Freksa. The search for frequent patterns is a top-down approach starting by the most general (empty) pattern and performing specialization steps by applying an optimal refinement operator. In a second step, prediction rules are generated by splitting the identified patterns into precondition and consequence parts. The developed concepts are implemented in the MiTemP system and are evaluated on synthetic data and soccer matches of the RoboCup simulation league.IOS Press is an international science, technical and medical publisher of high-quality books for academics, scientists, and professionals in all fields. Some of the areas we publish in: -Biomedicine -Oncology -Artificial intelligence -Databases and information systems -Maritime engineering -Nanotechnology -Geoengineering -All aspects of physics -E-governance -E-commerce -The knowledge economy -Urban studies -Arms control -Understanding and responding to terrorism -Medical informatics -Computer Sciences 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
Interface and border trap relaxation in Si-SiO2 structures with Ge nanocrystals examined by transient capacitance spectroscopy
Authors: R. Beyer, J. von Borany, H. Burghardt
Venue: Microelectronic Engineering (2009)

The formation of interface and border states in metal-oxide-semiconductor structures associated with the generation of embedded germanium nanocrystals in 20nm SiO"2-layers by means of ion implantation and a subsequent annealing was examined. Deep level transient spectroscopy and related time-domain techniques were applied in order to study the charge trapping and emission at the Si-SiO"2 interface. A significant dependence of the interface state density D"i"t on the conditions of the cluster generation was found. Any Ge-implanted sample features a pronounced level at about 0.31eV above the valence band edge and a concentration above 10^1^3cm^-^2eV^-^1, likely related to a P"b-center. A systematic variation of the filling pulse parameters was utilized in order to separate the response of fast and slow states, and to substantiate the existence of border traps located in the vicinity of the Si-SiO"2 interface. The role of interface and border traps for the relaxation of the trapped charge in the nanocrystals is illustrated.
Distributed constraint optimization with structured resource constraints
Authors: Akshat Kumar, Boi Faltings, Adrian Petcu
Venue: Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 2 (2009)

Distributed constraint optimization (DCOP) provides a framework for coordinated decision making by a team of agents. Often, during the decision making, capacity constraints on agents' resource consumption must be taken into account. To address such scenarios, an extension of DCOP- Resource Constrained DCOP- has been proposed. However, certain type of resources have an additional structure associated with them and exploiting it can result in more efficient algorithms than possible with a general framework. An example of these are distribution networks, where the flow of a commodity from sources to sinks is limited by the flow capacity of edges. We present a new model of structured resource constraints that exploits the acyclicity and the flow conservation property of distribution networks. We show how this model can be used in efficient algorithms for finding the optimal flow configuration in distribution networks, an essential problem in managing power distribution networks. Experiments demonstrate the efficiency and scalability of our approach on publicly available benchmarks and compare favorably against a specialized solver for this task. Our results extend significantly the effectiveness of distributed constraint optimization for practical multi-agent settings.