ppxscal/embedding_network huggingface dataset:
Network-aware migration control and scheduling of differentiated virtual machine workloads
Authors: Alexander Stage, Thomas Setzer
Venue: Proceedings of the 2009 ICSE Workshop on Software Engineering Challenges of Cloud Computing (2009)

Server virtualization enables dynamic workload management for data centers. However, especially live migrations of virtual machines (VM) induce significant overheads on physical hosts and the shared network infrastructure possibly leading to host overloads and SLA violations of co-hosted applications. While some recent work addresses the impact of live migrations on CPUs of physical hosts, little attention has been given to the control and optimization of migration algorithms and migration-related network bandwidth consumption. In this paper we introduce network topology aware scheduling models for VM live migrations. We propose a scheme for classifying VMs based on their workload characteristics and propose adequate resource and migration scheduling models for each class, taking network bandwidth requirements of migrations and network topologies into account. We also underline the necessity for additional migration control parameters for efficient migration scheduling.
Verifying Multithreaded Recursive Programs with Integer Variables
Authors: Narjes Ben Rajeb, Brahim Nasraoui, Riadh Robbana, Tayssir Touili
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2009)

We consider the verification problem of programs containing the following complex features: (1) dynamic creation of parallel threads, (2) synchronisation between parallel threads via global variables, (3) (possibly recursive) procedure calls, and (4) integer variables. The configurations of such programs are represented by terms, and their transitions by term rewriting systems. The novelty of our modeling w.r.t. other existing works consists in explicitely modeling integer variables in the terms. We propose a semi-decision procedure that, in case of termination, checks whether an infinite set of configurations, represented by a regular tree language, is reachable from an infinite set of initial configurations of the program (usually represented by a set of non ground terms). As fas as we know, this is the first time that reachability between non-ground terms and regular tree languages is considered. We implemented our techniques in a tool, and tested it successfully on several examples.
Flexible hardware-based stereo matching
Authors: Kristian Ambrosch, Wilfried Kubinger, Martin Humenberger, Andreas Steininger
Venue: EURASIP Journal on Embedded Systems (2008)

To enable adaptive stereo vision for hardware-based embedded stereo vision systems, we propose a novel technique for implementing a flexible block size, disparity range, and frame rate. By reusing existing resources of a static architecture, rather than dynamic reconfiguration, our technique is compatible with application specific integrated circuit (ASIC) as well as field programmable gate array (FPGA) implementations. We present the corresponding block diagrams and their implementation in our hardware-based stereo matching architecture. Furthermore, we show the impact of flexible stereo matching on the generated disparity maps for the sum of absolute differences (SADs), rank, and census transform algorithms. Finally, we discuss the resource usage and achievable performance when synthesized for an Altera Stratix II FPGA.
Reversible data hiding of a VQ index table based on referred counts
Authors: Cheng-Hsing Yang, Yi-Cheng Lin
Venue: Journal of Visual Communication and Image Representation (2009)

This paper presents a new reversible VQ-based hiding scheme that can recover the original VQ compressed codes after data extraction. Our scheme sorts a VQ codebook using the referred counts. The VQ codebook is then divided into 2^B clusters and half of these clusters are used to embed secret data, in which B denotes the size of the secret data embedded into each VQ index. Compared to Chang et al.'s scheme, which divides a sorted VQ codebook into 2^B^-^1x3 clusters and uses the front one-third clusters to embed secret data, our method can embed more data. Moreover, indicator, index exchanging, and side-match prediction schemes are proposed to further improve our scheme. Under the same sorted VQ codebook, the experimental results demonstrate that our data hiding algorithm has higher capacities and better compression rates.
Single-inductor dual-output (SIDO) DC---DC converters for minimized cross regulation and high efficiency in soc supplying systems
Authors: Ming-Hsin Huang, Ke-Horng Chen
Venue: Analog Integrated Circuits and Signal Processing (2009)

A compact size and high efficiency single-inductor dual-output (SIDO) DC---DC converter is proposed. The proposed SIDO DC---DC converter not only provides dual output sources (one buck and one boost outputs) but also has minimized cross regulation without using any external compensation components. Generally speaking, it is important to minimize the number of components and footprint area in the design of SIDO converters. However, usually large external compensation resistors and capacitors are required to stabilize DC---DC converters. Importantly, our proposed hysteresis mode operation can effectively avoid the oscillation problems that may exist in many SIMO designs. Furthermore, the dynamic dc current level like that in the continuous conduction mode (CCM) operation can make the proposed SIDO DC---DC converter achieve high conversion efficiency at light loads owing to small conduction loss. Experimental results show a high efficiency from 85% at light loads to 94% at heavy loads.
I like you, but I won't listen to you: Effects of rationality on affective and behavioral responses to computers that flatter
Authors: Eun-Ju Lee
Venue: International Journal of Human-Computer Studies (2009)

This experiment extended the computers are social actors (CASA) paradigm by investigating how rational thinking style moderates flattery effects in human-computer interaction. Participants played a trivia game with a computer, which they knew generated random answers that were accompanied by either strictly factual or flattering feedback on their performance. Although both high and low rationals attributed greater social attractiveness to the flattering computer than the one providing generic feedback, only low rationals exhibited different levels of conformity to flattering than generic-comment computers, favoring the latter. Results on recall memory and perceived validity of the computer feedback suggest that flattery elicited greater attention and heightened suspicion among those less prone to engage in analytical thinking, temporarily fostering mindfulness.
A durable and energy efficient main memory using phase change memory technology
Authors: Ping Zhou, Bo Zhao, Jun Yang, Youtao Zhang
Venue: Proceedings of the 36th annual international symposium on Computer architecture (2009)

Using nonvolatile memories in memory hierarchy has been investigated to reduce its energy consumption because nonvolatile memories consume zero leakage power in memory cells. One of the difficulties is, however, that the endurance of most nonvolatile memory technologies is much shorter than the conventional SRAM and DRAM technology. This has limited its usage to only the low levels of a memory hierarchy, e.g., disks, that is far from the CPU. In this paper, we study the use of a new type of nonvolatile memories -- the Phase Change Memory (PCM) as the main memory for a 3D stacked chip. The main challenges we face are the limited PCM endurance, longer access latencies, and higher dynamic power compared to the conventional DRAM technology. We propose techniques to extend the endurance of the PCM to an average of 13 (for MLC PCM cell) to 22 (for SLC PCM) years. We also study the design choices of implementing PCM to achieve the best tradeoff between energy and performance. Our design reduced the total energy of an already low-power DRAM main memory of the same capacity by 65%, and energy-delay2 product by 60%. These results indicate that it is feasible to use PCM technology in place of DRAM in the main memory for better energy efficiency.
A join point model for fine-grained aspects
Authors: Ulises Juarez-Martinez, Jose Oscar Olmedo-Aguirre
Venue: Proceedings of the 2nd conference on European computing conference (2008)

Crosscutting concerns, defined at the finest level of granularity for statements and expressions, considerably improves expressiveness of pointcut descriptions, making possible to address applications that cannot be approached otherwise. In this paper is introduced a join point model for fine-grained aspects based on path expressions defined upon the Abstract Syntax Tree of the method body. The model includes local variable crosscutting for getting and setting values within an expression. We show the capabilities of this model for an annotation processing concern.
Interactive natural language interface
Authors: Faraj A. El-Mouadib, Zakaria Suliman Zubi, Ahmed A. Almagrous, I. El-Feghi
Venue: WSEAS Transactions on Computers (2009)

To override the complexity of SQL, and to facilitate the manipulation of data in databases for common people (not SQL professionals), many researches have turned out to use natural language instead of SQL. The idea of using natural language instead of SQL has prompted the development of new type of processing method called Natural Language Interface to Database systems (NLIDB). The NLIDB system is actually a branch of more comprehensive method called Natural Language Processing (NLP). In general, the main objective of NLP research is to create an easy and friendly environment to interact with computers in the sense that computer usage does not require any programming language skills to access the data; only natural language (i.e. English) is required. Many systems have been developed to use the concept of NLP in different varieties of domains, for example the system LUNAR [19] and the system LADDER [8]. One drawback of previous systems is that the grammar must be tailor-made for each given database. Another drawback is that many NLP systems cover only a small domain of the English language questions. In this paper we present the design and implementation of a natural language interface to a database system. The system is called Generic Interactive Natural Language Interface to Databases (GINLIDB). It is designed by the use of UML and developed using Visual Basic. NET-2005. Our system is generic in nature given the appropriate database and knowledge base. This feature makes our system distinguishable.
Plenary lecture 6: relation between static and dynamic optimization in computer network routing
Authors: Milan Tuba
Venue: Proceedings of the 8th WSEAS international conference on Artificial intelligence, knowledge engineering and data bases (2009)

Computer network routing is a very important and interesting optimization problem. Many different routing algorithms have been used over the years on the Internet, often with unexpected problems. Dynamic systems, i.e. systems that change over time, can be optimized statically with a fixed solution that corresponds to some average system state, or dynamically where the solution tries to follow the system change over time. It is a normal expectation that dynamic optimization has to give better results than a static one. Dynamic optimization is more complex, requires more computation, more advanced methods, but is superior to static optimization because it can always be transformed to the static case simply by neglecting change of the system in time and selecting a single state as a representative. However, that expectation that dynamic optimization gives better results than static one applies only to the perfect dynamic optimization, which is impossible in practice. It takes some time to collect information about the system current state, and optimization is always done with that obsolete information. This situation is examined on computer network routing. By complete mathematical analysis of a simple network, we show that dynamic routing gives better results than static, as expected, but that the margin is much smaller then intuitively expected. Further analysis shows that minor advantage can easily be lost if there is even a small error in the dynamic routing tables, and actually dynamic routing can easily become worse than static. It takes time to collect information about network traffic. By the time routing tables are calculated, they are already obsolete; they are about some previous condition on the network, not the current one. Quantitative analysis shows that delays in building routing tables can affect dynamic routing performance unexpectedly strongly. This leads to the qualitative recommendation: "Trying to optimize too hard will make things worse. Dynamic routing should not try to adapt to traffic changes very fast." This hypothesis is accepted today and implemented in routing algorithms.
Construction of a Peer-to-Peer Information System in Grids
Authors: Agostino Forestiero, Carlo Mastroianni, Giandomenico Spezzano
Venue: Proceeding of the 2005 conference on Self-Organization and Autonomic Informatics (I) (2005)

A Grid information system should rely upon two basic features: the replication and dissemination of information about Grid services and resources, and an intelligent distribution of such information among Grid hosts. This paper examines an approach based on ant-based systems to replicate and map Grid services information on Grid hosts according to a given semantic classification of such services. Information is disseminated by agents (ants), which traverse the Grid by exploiting the P2P interconnections among Grid hosts. An entropy index is used to evaluate the performance of the proposed Ant-based Replication and MApping protocol (ARMAP), and control the dissemination of resource information. This approach enables the use of a semi-informed search algorithm which can drive query messages towards a cluster of peers having information about resources belonging to the requested class. A simulation analysis has been performed to evaluate the performance of the ARMAP protocol.
On K-LUT based FPGA optimum delay and optimal area mapping
Authors: Ion Bucur, Ioana Fagarasan, Cornel Popescu, Costin-Anton Boiangiu, George Culea
Venue: Proceedings of the 10th WSEAS international conference on Mathematical and computational methods in science and engineering (2008)

We developed, using structures from MV-SIS, an application dedicated to K-LUT based FPGA synthesis, named Xsynth. Main component of it, levelMap the mapping program, was implemented using the minDepth algorithm. The mapping program was instrumented in order to study and evaluate different heuristics involved in establishing best approach to find optimum delay and optimal area mapping. We did run our mapping application on many circuits from the MCNC and IWLS 2005 benchmark circuits and we obtained good results. We present our main model, procedures, measurement results and brief comparison with previous published relevant similar mapping algorithms.
CONOPS and autonomy recommendations for VTOL small unmanned aerial system based on Hurricane Katrina operations
Authors: Kevin S. Pratt, Robin Murphy, Sam Stover, Chandler Griffin
Venue: Journal of Field Robotics (2009)

This field study examines vertical takeoff and landing (VTOL) small unmanned aerial system (SUAS) operations conducted as part of an 8-day structural inspection task following Hurricane Katrina in 2005. From the observations of the 32 flights spread over 12 missions, four key findings are identified for concept of operations (CONOPS) and the next level of artificial intelligence for rotary-wing SUASs operating in cluttered urban environments. These findings are (1) the minimum useful standoff distance from inspected structures is 2&ndash;5 m, (2) omnidirectional sensor capabilities are needed for obstacle avoidance, (3) global positioning system waypoint navigation is unnecessary, and (4) these operations require three operators for one SUAS. Based on the findings and other observations, a crewing organization and flight operations protocol for SUASs are proposed. Needed directions in research and development are also discussed. These recommendations are expected to contribute to the design of platforms, sensors, and artificial intelligence as well as facilitate the acceptance of SUASs in the workplace. &copy; 2009 Wiley Periodicals, Inc.
Use of intuitive tools to enhance student learning and user experience
Authors: Rukiye Altin, Mustafà Bektik, Nuray Ekşioğlu, Can Koray, Ömer Canbek Öner, Merve Sadeta_, Hilal Şener, Duygu Simsek, Ching-Chen Ma, Christine Price, Christopher R. Routh
Venue: Proceedings of the 14th annual ACM SIGCSE conference on Innovation and technology in computer science education (2009)

Most user interfaces today present system functions by use of verbal or iconic symbols on static 2D menu pages organized in a hierarchical system [1]. This is unnatural to all human beings and must be learned, thus being a barrier between the full use and understanding of computer systems. With this problem in mind we set out to build a website and collaborative application for International Children's Center (ICC) which could be used not only across languages but across ages as well. This effort was tested on a daily basis by a multinational team consisting of students from the United States and Turkey as well as children from the respective countries. This attention to usability will not only lead to an intuitive tool for the client but also teach the students in the course how to build intuitive user interfaces.
BoltzRank: learning to maximize expected ranking gain
Authors: Maksims N. Volkovs, Richard S. Zemel
Venue: Proceedings of the 26th Annual International Conference on Machine Learning (2009)

Ranking a set of retrieved documents according to their relevance to a query is a popular problem in information retrieval. Methods that learn ranking functions are difficult to optimize, as ranking performance is typically judged by metrics that are not smooth. In this paper we propose a new listwise approach to learning to rank. Our method creates a conditional probability distribution over rankings assigned to documents for a given query, which permits gradient ascent optimization of the expected value of some performance measure. The rank probabilities take the form of a Boltzmann distribution, based on an energy function that depends on a scoring function composed of individual and pairwise potentials. Including pairwise potentials is a novel contribution, allowing the model to encode regularities in the relative scores of documents; existing models assign scores at test time based only on individual documents, with no pairwise constraints between documents. Experimental results on the LETOR3.0 data set show that our method out-performs existing learning approaches to ranking.
Stigmergic landmark foraging
Authors: Nyree Lemmens, Karl Tuyls
Venue: Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 1 (2009)

In this paper, we describe a nature-inspired optimization algorithm based on bee foraging behavior. This algorithm combines the high performance of bee path-integration navigation with ant-like stigmergic behavior in the form of landmarks. More precisely, each individual landmark can be created at any walkable state in the environment and contains a collection of direction markers with which visiting agents can find their way in an unknown environment. A landmark can either be represented by an agent or any other information distributing object (e.g., a RFID). Essentially, we implement ant recruitment behavior based on pheromone. However, instead of using attracting or repelling pheromone in every state of the environment, we only update directional information at key locations in the environment. The resulting algorithm, which we call Stigmergic Landmark Foraging (SLF), proves to be very efficient in terms of building and adapting solutions.
Some contributions to synthesis and implementation of multifunctional registers
Authors: Alexandru Valachi, Mihai Timis, Mirela Danubianu
Venue: Proceedings of the 2nd WSEAS international conference on Multivariate analysis and its application in science and engineering (2009)

In this paper the authors proposed a method for synthesis of digital systems which contains MFR devices (MultiFunctional Register) with clocked synchronised commands signals and fixed priority. Also, is suggested a new design methodology for the MFR devices. The proposed method is original because it uses only 2×1 multiplexors (MUX) which leads to an economical and easely digital implementation.
A quantitative model for user preferences based on qualitative specifications
Authors: Hamid Mukhtar, Djamel Belaïd, Guy Bernard
Venue: Proceedings of the 2009 international conference on Pervasive services (2009)

With an increasing number of devices having varying capabilities and with different types of network access mechanisms, an ordinary user will consider various tradeoffs for selecting one particular device over the other for execution of his task in an ad hoc environment. We propose a model for specifying user preferences so that the selection of the best device for the user is automated. Users specify their preferences and constraints qualitatively, which are then mapped on to a quantitative utility model. Preferences can be specified both for user's liking and dislike. We analyze the theory of TCP-nets as a formal model for representing and reasoning with qualitative preferences, and show how it can be used to create a quantitative preference model. Using an example scenario, the application of our model is shown and its utility against simple additive models is discussed.
Security enhanced integrative modeling language (SEIML): a conceptual modeling grammar for agile business information systems
Authors: Kirti Sudumbrekar, Nan Xiao, Raj Sharman, Sanjukta Das-smith
Venue: Proceedings of the 4th International Conference on Design Science Research in Information Systems and Technology (2009)

In this paper, we present a grammar SEIML for semi-autonomous multi-agent system specifically catering to the area of integrative business information systems (IBIS) environments. SEIML is intended to provide the necessary constructs to model a dynamic business organization that is adaptive to fast-changing business needs.