ppxscal/embedding_network huggingface dataset:
ARTIFICIAL INTELLIGENCE SOLUTION TO ELECTRICITY PRICE FORECASTING PROBLEM
Authors: Pavlos S. Georgilakis
Venue: Applied Artificial Intelligence (2007)

The market-clearing prices in deregulated electricity markets are volatile. Good market-clearing price forecasting will help producers and consumers to prepare their corresponding bidding strategies so as to maximize their profits. Market-clearing price prediction is a difficult task since bidding strategies used by market participants are complicated and various uncertainties interact in an intricate way. This article proposes the use of two artificial neural networks: the first to predict the day-ahead load and the second to forecast the day-ahead market-clearing prices. The methodology is applied to the California power market. After determining the optimal artificial neural network architecture with the minimum mean absolute percentage error on the test set, this architecture is used for price forecasting in periods with price spikes, for price forecasting for weekends, and for week-ahead MCP forecasting during the four seasons of the year. The forecasting accuracy of the artificial neural network model is compared with the accuracy of the persistence method and the results prove the efficiency and practicality of the proposed technique.
Improving the Scalability of P2P Streaming Based on Fine-Grained Balancing Scheme
Authors: Chow-Sing Lin, Wei-Ting Syu, I-Ting Lee
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications (2008)

In this paper, we relax the restriction of only one designated description forwarded by a peer described in our previously proposed balancing scheme and propose the fine-grained balancing scheme to further improve the scalability of P2P live streamingnetwork based on multiple description coding (MDC) techniques. Like the balancing scheme, the fine-grained balancing scheme is capable of balancing the distribution of descriptions and peer loading by a centralized description allocation scheme. In addition, according toour analysis, its flexibility of selecting desired descriptions and source peers favors the utilization of the aggregate bandwidth of P2P network. The performance study shows that our fine-grained balancing scheme can successfully reduce the consumption of server bandwidth and the rejection rate so that more clients can be served.
A Channel based Fair Scheduling Scheme for Downlink Data Transmission in TD-CDMA Networks
Authors: Ying Zhao, Alagan Anpalagan
Venue: Wireless Personal Communications: An International Journal (2008)

High speed data transmission in wireless networks demands better radio resource management schemes. A fair packet scheduling is proposed for downlinks of a cellular TD-CDMA system for delay-tolerant applications. It is based on the combined consideration of channel conditions, required throughput and achieved average throughput. A system dependent parameter is introduced to control the maximum achievable date rate as well as the degree of fairness. Through analysis and simulation, we study the tradeoff between system throughout (i.e., efficiency) and individual throughput (i.e., fairness). The relative performance between the proposed scheme and the traditional schemes is evaluated through simulation to confirm the analytical observations. The sensitivity of the system tolerance factor towards efficiency and fairness is also investigated.
Destructive-read in embedded DRAM, impact on power consumption
Authors: Haakon Dybdahl, Per Gunnar Kjeldsberg, Marius Grannæs, Lasse Natvig
Venue: Journal of Embedded Computing (2006)

This paper explores power consumption for destructive-read embedded DRAM. Destructive-read DRAM is based on conventional DRAM design, but with sense amplifiers optimized for lower latency. This speed increase is achieved by not conserving the content of the DRAM cell after a read operation. Random access time to DRAM was reduced from 6 ns to 3 ns in a prototype made by Hwang et al. A write-back buffer was used to conserve data. We have proposed a new scheme for write-back using the usually smaller cache instead of a large additional write-back buffer. Write-back is performed whenever a cache line is replaced. This increases bus and DRAM bank activity compared to a conventional architecture which again increases power consumption. On the other hand computational performance is improved through faster DRAM accesses. Simulation of a CPU, DRAM and a 2 kbytes cache show that the power consumption increased by 3% while the performance increased by 14% for the applications in the SPEC2000 benchmark. With a 16 kbytes cache the power consumption increased by 0.5% while performance increased by 4.5%.
A rank-aggregation approach to searching for optimal query-specific clusters
Authors: Oren Kurland, Carmel Domshlak
Venue: Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval (2008)

To improve the precision at the very top ranks of a document list presented in response to a query, researchers suggested to exploit information induced from clustering of documents highly ranked by some initial search. We propose a novel model for ranking such (query-specific) clusters by the presumed percentage of relevant documents that they contain. The model is based on (i) proposing a palette of "witness" cluster properties that purportedly correlate with this percentage, (ii) devising concrete quantitative measures for these properties, and (iii) ordering the clusters via aggregation of rankings induced by these individual measures. Empirical evaluation shows that our model is consistently more effective than previously suggested methods in detecting clusters containing a high relevant-document percentage. Furthermore, the precision-at-top-ranks performance of this model transcends that of standard document-based retrieval, and competes with that of a state-of-the-art document-based retrieval approach.
Designing marketing experiences
Authors: Lene Mailund, Kim Halskov
Venue: Proceedings of the 7th ACM conference on Designing interactive systems (2008)

The two-dimensional model presented in this article is a contribution to the discussion of the ways in which IT-based marketing experiences in a physical setting may be designed and understood. In the presentation of the model, the focus has been on central issues regarding the design of the IT-based experience's physical design, interaction, and content, with regard to ensuring the achievement of the desired behavioural, cognitive, and affective effects, and, in the final analysis, the desired overarching marketing effect. The paper draws on three installations from a research project, which include two commercial partners: a major department store, and a large international chewing gum research and manufacturing company, whose primary marketing channels are international sweets conventions. Additional inspiration for the model's strategies have been drawn from the field of digital art installation.
Approximate solution of singular integro-differential equations by reduction methods in generalized Hölder spaces
Authors: Feras M. Al-Faqih, Nikos E. Mastorakis, Iurie Caraus
Venue: Proceedings of the 10th WSEAS International Conference on APPLIED MATHEMATICS (2006)

In present paper we elaborated the numerical schemes of reduction methods for approximative solution of Singular Integro- Differential Equations with kernels of Cauchy type. The equations are defined on the arbitrary smooth closed contours of complex plane. The researched methods are based on the Faber-Laurent polynomials. Theoretical background of reduction methods has been obtained in Generalized Hölder spaces.
KNOWLEDGE MANAGEMENT: AN INTEGRATIVE VIEW AND EMPIRICAL EXAMINATION
Authors: Joanna Paliszkiewicz
Venue: Cybernetics and Systems (2007)

A lot of enterprises put a great emphasis on knowledge management. In this article the aspects connected with building an integrative knowledge management model have been presented. Author has also described researches connected with this topic. The relationships among social perspective, technical perspective, knowledge management processes, and organizational performance were considered.
Rapid design and evaluation framework for wireless sensor networks
Authors: Mauri Kuorilehto, Marko Hännikäinen, Timo D. Hämäläinen
Venue: Ad Hoc Networks (2008)

The diversity of applications and typically scarce node resources set very tight constraints to Wireless Sensor Networks (WSN). It is not possible to fulfill all requirements with a general purpose WSN, for which reason the rapid development of application specific WSNs is preferred. We present a new framework called WIreless SEnsor NEtwork Simulator (WISENES) for the design, simulation, and evaluation of WSNs. The target WSN is designed in Specification and Description Language (SDL), simulated in WISENES, and implemented on target platform either through automatic code generation or manually. The high-level WSN model is back-annotated with the measured values from a real platform. In this way, very accurate WSN simulations can be performed with a rapid design cycle. WISENES itself has been verified with TUTWSN (Tampere University of Technology Wireless Sensor Network) and ZigBee protocols. The MAC protocol of ZigBee was designed in two weeks from scratch by one designer, which shows the effectiveness of WISENES. For accuracy comparison, the results show 6.7% difference between the modeled and measured TUTWSN prototype power consumption. WISENES hastens the evaluation of new protocol and application configurations, especially for the large scale and long-term WSN deployments.
Inter-domain Authentication for Seamless Roaming in Heterogeneous Wireless Networks
Authors: Summit R. Tuladhar, Carlos E. Caicedo, James B. D. Joshi
Venue: Proceedings of the 2008 IEEE International Conference on Sensor Networks, Ubiquitous, and Trustworthy Computing (sutc 2008) (2008)

The inter-operation among heterogeneous wireless networks is crucial to support ubiquitous mobility and seamless roaming. Handoffs across wireless networksin separate administrative domains should ensure uninterrupted service and authenticity of the entities involved. However, the re-authentication of a mobile node (MN) during a handoff across administrative domains typically involves several round trips to the home domain which produce long latencies [9, 12]. A new authentication protocol based on the use of proof tokens is presented in this paper which allows a MN to authenticate in a foreign domain without requiring communication with its home domain. Moreover, the foreign domain is only required to have a trust relationship with any one of MN's previously visited domains, and not necessarily with the home domain. Our objective is to provide an improved authentication approach for ubiquitous mobility and seamless roaming that does not compromise the security of the handoff process while providing low delays.
Harvana: harvesting community tags to enrich collection metadata
Authors: Jane Hunter, Imran Khan, Anna Gerber
Venue: Proceedings of the 8th ACM/IEEE-CS joint conference on Digital libraries (2008)

Collaborative, social tagging and annotation systems have exploded on the Internet as part of the Web 2.0 phenomenon. Systems such as Flickr, Del.icio.us, Technorati, Connotea and LibraryThing, provide a community-driven approach to classifying information and resources on the Web, so that they can be browsed, discovered and re-used. Although social tagging sites provide simple, user-relevant tags, there are issues associated with the quality of the metadata and the scalability compared with conventional indexing systems. In this paper we propose a hybrid approach that enables authoritative metadata generated by traditional cataloguing methods to be merged with community annotations and tags. The HarvANA (Harvesting and Aggregating Networked Annotations) system uses a standardized but extensible RDF model for representing the annotations/tags and OAI-PMH to harvest the annotations/tags from distributed community servers. The harvested annotations are aggregated with the authoritative metadata in a centralized metadata store. This streamlined, interoperable, scalable approach enables libraries, archives and repositories to leverage community enthusiasm for tagging and annotation, augment their metadata and enhance their discovery services. This paper describes the HarvANA system and its evaluation through a collaborative testbed with the National Library of Australia using architectural images from PictureAustralia.
Seamless QoS Guarantees in Mobile Internet Using NSIS with Advance Resource Reservation
Authors: Sooyong Lee, Myungchul Kim, Kyounghee Lee, Soonuk Seol, Gabsoo Lee
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications (2008)

Providing seamless multimedia services to mobile users is one of the important requirements for the current Internet evolution. However, due to the effects of host mobility, it is difficult to achieve seamless QoS guarantees in mobile Internet. Though Next Step In Signaling (NSIS) protocol was recently proposed as an alternative of RSVP, its applicability has not been completely verified particularly in mobile environment. This paper enhances NSIS protocol based on advance resource reservation using Layers 2 and 3 complementation for supporting host mobility. Our approach detects a crossover node (CRN) and reserves network resources proactively along the new path which will be used after handoff. This significantly reduces the latency of signaling session re-establishment caused by handoff. Only a few modifications are required to the current NSIS protocol for our approach. The experimental results demonstrate that our approach can provide seamless QoS guarantees for multimedia services in mobile Internet.
Web Services from an Agent Perspective
Authors: Terry R. Payne
Venue: IEEE Intelligent Systems (2008)

The growth of automated services on the Web has facilitated the emergence of a new software development paradigm. This paradigm is based on the composition of disparate services to achieve large-scale, reusable solutions for diverse domains. Borrowing heavily from research in object-oriented software engineering and multiagent systems, the Web service paradigm supports the construction, publication, provision, integration, and utilization of course-grained, software services in open, heterogeneous environments. This article examines this Web service paradigm from an open multiagent systems perspective and contrasts the formally grounded, knowledge-centric view of agents with the pragmatic, declarative, bottom-up approach adopted by Web services.
Super-Resolution of Video Sequences Using Local Motion Estimates
Authors: Jeffrey B. Colombe, Burhan Necioglu
Venue: Proceedings of the 36th Applied Imagery Pattern Recognition Workshop (2007)

We present a method for boosting the resolution of ‘target’ frames of video using available supra-Nyquist information in surrounding frames during slow scene motion. Pixels in the frames surrounding a target frame were aligned to the target frame at subpixel resolution, by estimating translations of small upsampled image patches surrounding each pixel. This analysis was performed locally in order to account for the kinds of complex scene motion typical of human face imagery, motion which cannot often be effectively modeled using whole-image 2D affine transforms. Composite super-resolved images were built up from translated pixels, and missing pixels in the super-resolved pixel plane were imputed via adaptive-bandwidth bandpass interpolation and median filtering. Ambiguities in motion estimation due to the ‘aperture problem’ were systematically explored through visualization.
Estimation of cost efficiency of Australian universities
Authors: Jocelyn Horne, Baiding Hu
Venue: Mathematics and Computers in Simulation (2008)

The purpose of this paper is to quantify the efficiency with which Australian universities utilise their teaching resources. The study estimates the cost efficiency of 36 universities over the period 1995-2002 using stochastic frontier analysis. The present study differs from previous cost and efficiency studies of Australian universities in two respects. First, it employs stochastic frontier analysis for the specification of a cost function for Australian universities which allows for the estimation of cost efficiency for each university under study. Second, a panel data set is utilised in the estimation of the cost function which enables not only comparisons of cost efficiency between universities but also an econometric testing of the assumption of an identical cost function for every university. The main finding is that universities are not operating efficiently as measured by cost efficiency and in relative terms. An efficiency ranking is derived and policy inferences are discussed.
Hypothetical complexity of the nowhere-zero 5-flow problem
Authors: Martin Kochol
Venue: Journal of Graph Theory (1998)

We show that if the well-known 5-Flow Conjecture of Tutte is not true, then the problem to determine whether a (cubic) graph admits a nowhere-zero 5-flow is NP-complete. &copy; 1998 John Wiley & Sons, Inc. J Graph Theory 28: 1&ndash;11, 1998
Counting and cutting cycles of lines and rods in space
Authors: B. Chazelle
Venue: Proceedings of the 31st Annual Symposium on Foundations of Computer Science (1990)

A number of rendering algorithms in computer graphics sort three-dimensional objects by depth and assume that there is no cycle that makes the sorting impossible. One way to resolve the problem caused by cycles is to cut the objects into smaller pieces. The problem of estimating how many such cuts are always sufficient is addressed. A few related algorithmic and combinatorial geometry problems are considered.
Connectivity in cooperative wireless ad hoc networks
Authors: Liaoruo Wang, Benyuan Liu, Dennis Goeckel, Don Towsley, Cedric Westphal
Venue: Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing (2008)

Connectivity and capacity are two measures for the performance of mobile ad hoc networks that have been studied extensively under standard point-to-point physical layer assumptions. However, extensive recent research at the physical layer has demonstrated the improvement in performance possible when multiple radios concurrently transmit in the same radio channel. In this paper, we consider how such physical layer cooperation improves the connectivity in wireless ad hoc networks. In particular, with noncoherent cooperation at the physical layer, we consider conditions on the node density λ (or, equivalently, the transmit power) for full connectivity and percolation for large networks in various dimensions and with various path loss exponents α. For one-dimensional (1-D) extended networks, in sharp contrast to noncooperative networks, we demonstrate that full connectivity can be realized under certain conditions. In particular, for any node density with path loss exponent α
Self-Adaptable and Intrusion Tolerant Certificate Authority for Mobile Ad Hoc Networks
Authors: Fernando Carlos Pereira, Joni da Silva Fraga, Ricardo Felipe Custódio
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications (2008)

Dynamic distributed systems like peer-to-peer systems, overlay networks and mobile ad hoc networks must execute their applications using distributed resources and in a decentralized way. The structure (composition and topology) of these systems changes frequently due to nodes joining or leaving the network, or due to mobility, faults and networks partitions. Distributed algorithms projected to this class of systems must be able to deal with the occurrence of these events and to self-adapt dynamically the application according to changes in its execution environment. In this paper, we propose a dynamic, self-adaptable and intrusion tolerant certificate authority (CA) designed to operate in mobile ad hoc networks. This CA is composed by a set of mobile devices present in the network, which forms a group of servers that supports CA functions. This architecture is based on a dynamic systems model and was conceived to manage changes in the membership of the servers group. This paper introduces an algorithmic base that allows the CA to reconfigure itself, guaranteeing the availability and the inviolability of the certification service.
Implementing Algebraic Combinatorics Some feedback from the development of MuPAD-Combinat (abstract only)
Authors: Nicolas M. Thiery
Venue: ACM Communications in Computer Algebra (2008)

MuPAD-Combinat is an open-source algebraic combinatorics package for the computer algebra system MuPAD. Its main purpose is to provide an extensible toolbox for computer exploration, and to foster code sharing between researchers in this area. The development started in 2001, and it now contains functions to deal with most usual combinatorial classes (partitions, tableaux, decomposable classes, ...). It also supplies the user with tools for constructing new combinatorial classes and combinatorial (Hopf) algebras. As an application, it provides well-known combinatorial Hopf algebras like the algebra of symmetric functions and many generalizations. There is also experimental support for combinatorial Lie algebras, operads, (affine) Weyl groups, crystals, Schubert polynomials, invariant rings, ... Altogether, MuPAD-Combinat played a central role in 25+ publications with more than a dozen contributors. In this talk, we first demonstrate the main functionalities of the package and present some typical applications. Based on that, we discuss its design, successes and flaws, and its future. Feel free to contact the speaker if you would like to get some first hand experience through an informal tutorial, and bring your laptop if you have one.
SOM-Based Modelling for an Activated Sludge Treatment Process
Authors: Mikko Heikkinen, Tomi Latvala, Esko Juuso, Yrjö Hiltunen
Venue: Proceedings of the Tenth International Conference on Computer Modeling and Simulation (2008)

The control of an activated sludge treatment plant depends on on-line process data and measurements made in the laboratory. The most important quality indicators of activated sludge are settling properties. Even though the behaviour of activated sludge is basically known, long lags and the complex characteristic of biological activity set a challenge for controlling the process. In this paper, the process lags of an activated sludge treatment plant are determined by a cross-correlation method. We also demonstrate the use of Self-Organizing Maps (SOM) for analysing an activated sludge treatment process. A data set of the process was used for training a SOM, which could be used for estimating the diluted sludge volume index (DSVI). The results of a validation data set showed a good agreement between the actual and estimated values of DSVI. The results indicate that the SOM method can also be efficiently applied to the analysis of the activated sludge treatment process and so towards better process control.
Discrete Model to Estimate Lifetime of a Wireless Sensor Network for Audio Storage
Authors: Sajid Hussain, Patrick Drane, Michael Mallinson
Venue: Proceedings of the Communication Networks and Services Research Conference (2008)

Wireless sensor networks (WSNs) can be used to record and store audio data at remote and inaccessible places. However, audio data adds an additional concern to the design of the WSN; the motes need a larger amount of memory resources to be able to store the collected data. In this paper, we evaluate the ideas already presented, specifically the EnviroMic, for data collection and storage and apply a realistic power consumption model to estimate the lifetime of an audio sensor network.