Search

The importance of updating, expanding and improving what is taught in cybersecurity curricula is increasing as the security threat landscape becomes more dangerous, breaches become more frequent, and the number of deployed Internet of Things (IoT) devices, known for their security challenges, grows exponentially. This paper argues that a profile of "T-shaped" skills, which is known to be desirable in many consulting and design professions, is being reflected in the latest manifestations of cybersecurity curriculum design and accreditation. A model of learning that yields "T-shaped" professionals combines the ability to apply knowledge across domains (breadth) with the ability to apply functional and disciplinary skills (depth). We present the design of a junior- or senior-level cybersecurity course in which the horizontal stroke of the "T" (representing breadth) spans knowledge areas that cut across the people, process and technology triad. The vertical stroke of the "T" (representing depth) is provided by two aspects of the course design: first, learning the foundational principles of cybersecurity, including practical examples from cryptography and network security; and second, applying the principles of cybersecurity to a semester project, allowing students to expand the core "T" of the course to satisfy their own passions and interests. Our paper concludes with student and instructor reflections on the implementation of this cybersecurity course, as well as broader implications of the lessons learned after the initial offering of this course.

Bitcoin, Litecoin, Dogecoin, et al "cryptocurrencies" have enjoyed a meteoric rise in popularity and use as a way of performing transactions on the Internet and beyond. While gaining market valuations of billions of dollars and generating much popular press in doing so, little has been academically published on the Computer Science/Information Systems (CS/IS) foundations of this phenomena. This paper describes these foundations. In doing so, it is hoped that the success of the cryptocurrency payment systems can be used to demonstrate to CS/IS students how computer theory can be integrated into other disciplines with dramatic results.

Drawing on the experiences of a novel collaborative project between sociologists and computer scientists, this paper identifies a set of challenges for fieldwork that are generated by this "wild interdisciplinarity. Public Access Wi-Fi Service" was a project funded by an 'in-the-wild' research programme, involving the study of digital technologies within a marginalised community, with the goal of addressing digital exclusion. We argue that similar forms of research, in which social scientists are involved in the deployment of experimental technologies within real world settings, are becoming increasingly prevalent. The fieldwork for the project was highly problematic, with the result that few users of the system were successfully enrolled. We analyse why this was the case, identifying three sets of issues which emerge in the juxtaposition of interdisciplinary collaboration and wild setting. We conclude with a set of recommendations for projects involving technologists and social scientists.

This paper presents the integration of ubiquitous computing systems into classroom settings, in order to provide basic support for classrooms and field activities. We have developed web application components using Java technology and configured a classroom with wireless network access and a web camera for our purposes. In this classroom, the students interact among each other and with the professor through an Internet-enabled personal digital assistant (PDA), using the different modules described in this paper. We include our evaluations about the performance and usability of the system in a computer science related course of the University of Tokushima, other practical uses including outdoor learning activities, and future research and development work. (Contains 2 tables and 10 figures.)

Children in the back seat on a long trip are not the only ones asking the question "Are we there yet?" At Murray State University (MSU) and other universities starting new programs, the question becomes one of validation of the program. In the late 90s, MSU, a midsize university, was entrusted with the responsibility of developing a program of distinction with financial support from special state funds. The objective of this program was to establish a high-quality, interdisciplinary technical and business, undergraduate and graduate curriculum in telecommunications system management. A review of literature concerning academic technology disciplines revealed that most authors agree there is a continuum of computing disciplines from purely technical programs such as Electrical Engineering (EE) to highly business oriented programs such as Management of Information Systems (MIS) with telecommunications falling somewhere within the continuum. As the MSU Telecommunications System Management (TSM) program was conceived to be an interdisciplinary program of business and technology, we have asked ourselves where it resides in this continuum. The focus of our review centered on where the TSM program would fit in the continuum in relation to computer science (CS), information systems (IS), and information technology (IT) programs, all of which are established academic disciplines from which the initial MSU curriculum was drawn. To articulate the unique value the TSM program must provide to its students in order to be recognized as a "program of distinction," MSU needs to know where the program is in relation to established academic disciplines. This paper examines the curriculum directions taken at MSU in the undergraduate Bachelor of Science (BS) and graduate Master of Science (MS) programs several years after its creation, in an extremely dynamic discipline, in order to understand what the TSM program is currently offering students. With this understanding, the TSM BS program was analyzed using the methodology published in the Journal of Information Technology Education Volume 3 article: An empirical comparison of baccalaureate programs in computing (Reichgelt, Lunt, Phelps, Salzinski, & Willis, 2004). Statistical analysis of the TSM program when compared simultaneously to typical computer science (CS), information systems (IS), and information technology (IT) programs indicates there is a significant difference in the program; however, when compared to each of these programs individually, the significant difference was not as strongly indicated. Using this research, a strong empirical argument can be made that the TSM program is different from CS, but empirical arguments that it is significantly different from the average IS or IT programs are not as strong. Therefore, MSU can not use this methodology to articulate its unique value in comparison to IS and IT. The new TSM program, like most new programs in non-established academic disciplines, can be thought of as distinct simply because it was designed to be different, the "old intangible argument". As the academic community does not have an accredited telecommunications model as in CS and IS (Association for Computing Machinery, 2005), nor an emerging one such as in IT (Hart, 2006), how does MSU articulate the value of its program to both students and potential employers using empirical data? Additionally, there is neither an established model such as the Computing Program Academic Model (CPAM) proposed by Anthony (2003), nor an accepted empirical methodology in place to provide MSU a foundation to make a tangible case for the program's value to students and industry. (Contains 6 figures and 8 tables.)

Providing adequate computing lab support for Management Information Systems (MIS) and Computer Science (CS) programs is a perennial challenge for most academic institutions in the US and abroad. Factors, such as lack of physical space, budgetary constraints, conflicting needs of different courses, and rapid obsolescence of computing technology, precipitate this challenge. While introductory computing courses can be adequately supported through general labs, advanced computing courses typically require dedicated labs. Normally, however, even a dedicated lab must simultaneously support multiple courses with diverse support requirements. Consequently, in designing dedicated computing labs, versatility and flexibility of the lab must be the prime consideration. Drawing on the insights gained from developing a dedicated lab, the authors present a model for developing a versatile, flexible lab to support computer network courses. The proposed model entails a modular design approach which offers ease of management, configuration and upgrading of the lab by decoupling the lab functions into layers. The layered design divides the lab into four management layers: (1) wiring layer, (2) networking layer, (3) server systems layer, and (4) support procedures layer. Each layer offers a versatile and configurable design and serves as a foundation for the next higher layer. "Wiring layer" minimizes the wire configuration efforts and enhances wiring flexibility by utilizing patch panels at the computer desks and the racks housing networking devices, and sufficient underground wiring between desks and racks. The underground wiring allows for network, telephone and serial cable connections as needed. "Network layer" builds LANs, subnets and internets with minimal configuration effort through a careful arrangement of network hubs, switches, routers, and firewalls. The network layer distinguishes between permanent networks needed in the lab, called pre-configured networks, and the networks that are assembled and disassembled by the students, called configurable networks. The network address allocation schemes for different types of network experiments are also discussed. "Server systems layer" covers two categories of servers: pre-configured servers and configurable servers. Pre-configured servers, such as DNS and file servers, are production servers that support network experiments. Configurable servers are hardware platforms that can be configured as needed according to experimental needs. The last layer, "procedural layer", provides policies, guidelines and operational procedures that are needed for proper utilization of the lab space and the equipment. The paper also illustrates the application of the proposed model through the design and configuration of the computing lab for network courses underlying this case study. (Contains 6 figures and 2 tables.)

The goal of this project is to develop a unique simulation environment that can be used to increase students' interest and expertise in Computer Science curriculum. Hands-on experience with physical or simulated equipment is an essential ingredient for learning, but many approaches to training develop a separate piece of equipment or software for each topic area. We describe the development of a simulation environment that provides a foundation for cross-disciplinary exercises. The Wireless Intelligent agent Simulation Environment (WISE), which combines activities from virtual and physical versions of the Wumpus World game, provides a dynamic learning environment that can enhance a number of Computer Science courses. In this paper, we describe the WISE environment design. We also describe steps for integrating WISE into Computer Science curriculum. As a demonstration of the effectiveness of the tool, we describe its use in the artificial intelligence, multimedia, and wireless networks courses at the University of Texas at Arlington.

Presents the special issue in the journal "Parallel Processing Letters," which contains the best papers from the Centre Interantional de Rencontres Mathématiques workshopin October 2001. "Scheduling Issues in Survivality Applications Using Hybrid Fault Models," by A. W. Krings, W. S. Harrison, A. Azadmanesh and M. McQueen"; "Parallel Tabu Search Approaches for Two-Dimensional Cutting," by J. Blazewicz, A. Moret-Salvador and R. Walkowiak"; "Strategies for Workload Balancing in Cluster-Based Image Databases," by F. Drews, K. Ecker, O. Kao and S. Schomann.

Most electrical engineering and computer science undergraduate programs include at least one course on microcontrollers and assembly language programming. Some departments offer legacy courses in C programming, but few include C programming from an embedded systems perspective, where it is still regularly used. Distributed computing and parallel processing are subjects generally reserved for graduate programs or specialized degrees. And although it is common to provide undergraduate courses on computer networks, the typical curriculum focuses on TCP/IP and Ethernet LANs, rarely venturing into the lesser known but commonly used networks such as the controller area network. By developing a computer cluster using simple microcontroller cards which communicate over a CAN, students are exposed to the intricacies of network communication, basic parallel and distributed processing concepts, and real-time embedded systems development. This paper presents the design of a

A directory service keeps track of the location and status of mobile objects in a distributed system. This paper describes our experience implementing two distributed directory protocols as part of the Aleph toolkit, a distributed shared object system implemented in Java. One protocol is a conventional home-based protocol, in which a fixed node keeps track of the object's location and status. The other is a novel Arrow protocol, based on a simple path-reversal algorithm. We were surprised to discover that the Arrow protocol outperformed the home protocol, sometimes substantially, across a range of system sizes. This paper describes a series of experiments testing whether the discrepancy is due to an artifact of the Java run-time system (such as differences in thread management or object serialization costs), or whether it is something inherent in the protocols themselves. In the end, we use insights gained from these experimental results to design a new directory protocol that combines advantages of both. Copyright © 2000 John Wiley & Sons, Ltd. [ABSTRACT FROM AUTHOR]

Graphs are used to solve many problems in mathematics and computer sciences. Many structures can be displayed with the help of graphs. For example, a directed graph can be used to show how websites are related to each other. Vague graph (VG) is one of the most important graphs in the fuzzy graph (FG)-theory, which can play a significant role in finding the most suitable places in construction and also finding the shortest path in computer networks. Connectivity indices are one of the most widely used topics in graph theory, which are used in other sciences, including computer science and chemistry. One of the most famous indices in the graph is the Wiener index, which belongs to the description of the molecular structure, which is used to design molecules with desirable properties. Therefore, in this paper, we introduce important topological indices such as Wiener index, Wiener absolute index, Randic index, Zegreb index, Harmonic index, and Average Wiener index on VGs and investigate their properties with several examples. Finally, an application of the Wiener index is given to find the most suitable place to build an university. [ABSTRACT FROM AUTHOR]

In various fields, different networks are used, most of the time not of a single kind; but rather a mix of at least two networks. These kinds of networks are called bridge networks which are utilized in interconnection networks of PC, portable networks, spine of internet, networks engaged with advanced mechanics, power generation interconnection, bio-informatics and substance intensify structures. Any number that can be entirely calculated by a graph is called graph invariants. Countless mathematical graph invariants have been portrayed and utilized for connection investigation during the latest twenty years. Nevertheless, no trustworthy evaluation has been embraced to pick, how much these invariants are associated with a network graph or subatomic graph. In this paper, it will discuss three unmistakable varieties of bridge networks with an incredible capacity of assumption in the field of computer science, chemistry, physics, drug industry, informatics and arithmetic in setting with physical and manufactured developments and networks, since Contraharmonic-quadratic invariants (CQIs) are recently presented and have different figure qualities for different varieties of bridge graphs or networks. The study settled the geography of bridge graphs/networks of three novel sorts with two kinds of CQI and Quadratic-Contraharmonic Indices (QCIs). The deduced results can be used for the modeling of the above-mentioned networks. [ABSTRACT FROM AUTHOR]

A calendar of events related to computer science to be held between September 2009 and December 2010 is presented, which includes the 18th International Symposium on Methodologies for Intelligent Systems, the 19th International Conference on Artificial Neural Network, and the International Conference on Intelligent Computing.

The concepts of fuzzy graph theory are applied in many areas of computer science including data mining, image segmentation, clustering, and image capturing. A vague graph, a generalization of a fuzzy graph, is more useful for decision making problems, social network models and computer network models. In this paper, we introduce the concept of vague neutrosophic graphs. We present the dominating and independent sets of vague neutrosophic graphs. Some properties of regular, totally regular, irregular, and totally irregular vague neutrosophic graphs are discussed. We develop the vague neutrosophic weighted average operator (Aω) and vague neutrosophic weighted geometric operator (Gω) to aggregate the vague neutrosophic information. Furthermore, we develop a vague neutrosophic multiple criteria decision making approach, in which the evaluation values of alternatives on the attributes take the form of vague neutrosophic numbers to select the most desirable one(s). Finally, a numerical example of the method was given to demonstrate the application and effectiveness of the developed method. [ABSTRACT FROM AUTHOR]

Multi-Agent Systems (MAS) have been seen as an attractive area of research for civil engineering professionals to subdivide complex issues. Based on the assignment's history, nearby agents, and objective, the agent intended to take the appropriate action to complete the task. MAS models complex systems, smart grids, and computer networks. MAS has problems with agent coordination, security, and work distribution despite its use. This paper reviews MAS definitions, attributes, applications, issues, and communications. For this reason, MASs have drawn interest from computer science and civil engineering experts to solve complex difficulties by subdividing them into smaller assignments. Agents have individual responsibilities. Each agent selects the best action based on its activity history, interactions with neighbors, and purpose. MAS uses the modeling of complex systems, smart grids, and computer networks. Despite their extensive use, MAS still confronts agent coordination, security, and work distribution challenges. This study examines MAS's definitions, characteristics, applications, issues, communications, and evaluation, as well as the classification of MAS applications and difficulties, plus research references. This paper should be a helpful resource for MAS researchers and practitioners. MAS in controlling smart grids, including energy management, energy marketing, pricing, energy scheduling, reliability, network security, fault handling capability, agent-to-agent communication, SG-electrical cars, SG-building energy systems, and soft grids, have been examined. More than 100 MAS-based smart grid control publications have been reviewed, categorized, and compiled. [ABSTRACT FROM AUTHOR]

Any number that can be uniquely determined by a graph is called a graph invariant. During the last twenty years' countless mathematical graph invariants have been characterized and utilized for correlation analysis. However, no reliable examination has been embraced to decide, how much these invariants are related with a network graph or molecular graph. In this paper, it will discuss three different variants of bridge networks with good potential of prediction in the field of computer science, mathematics, chemistry, pharmacy, informatics and biology in context with physical and chemical structures and networks, because k-banhatti sombor invariants are freshly presented and have numerous prediction qualities for different variants of bridge graphs or networks. The study solved the topology of a bridge graph/networks of three different types with two invariants KBanhatti Sombor Indices and its reduced form. These deduced results can be used for the modeling of computer networks like Local area network (LAN), Metropolitan area network (MAN), andWide area network (WAN), backbone of internet and other networks/structures of computers, power generation, bio-informatics and chemical compounds synthesis. [ABSTRACT FROM AUTHOR]

The evolution of smart contracts in recent years inspired a crucial question: do smart contract evaluation protocols provide the required level of privacy when executing contracts on the blockchain? The Hawk (IEEE S&P '16) paper introduces a way to solve the problem of privacy in smart contracts by evaluating the contracts off-chain, albeit with the trust assumption of a manager. To avoid the partially trusted manager altogether, a novel approach named zkHawk (IEEE BRAINS '21) explains how we can evaluate the contracts privately off-chain using a multi-party computation (MPC) protocol instead of trusting said manager. This paper dives deeper into the detailed construction of a variant of the zkHawk protocol titled V-zkHawk using formal proofs to construct the said protocol and model its security in the universal composability (UC) framework (FOCS '01). The V-zkHawk protocol discussed here does not support immediate closure, i.e., all the parties (n) have to send a message to inform the blockchain that the contract has been executed with corruption allowed for up to t parties, where t < n . In the most quintessential sense, the V-zkHawk is a variant because the outcome of the protocol is similar (i.e., execution of smart contract via an MPC function evaluation) to zkHawk, but we modify key aspects of the protocol, essentially creating a small trade-off (removing immediate closure) to provide UC (stronger) security. The V-zkHawk protocol leverages joint Schnorr signature schemes, encryption schemes, Non-Interactive Zero-Knowledge Proofs (NIZKs), and commitment schemes with Common Reference String (CRS) assumptions, MPC function evaluations, and assumes the existence of asynchronous, authenticated broadcast channels. We achieve malicious security in a dishonest majority setting in the UC framework. [ABSTRACT FROM AUTHOR]

To satisfy requirements such as scalability and availability, many of today's applications are distributed systems. But because designing and implementing such systems is inherently difficult, developers are increasingly turning to decades of distributed systems research for guidance. This article briefly explores important areas of distributed systems research along with some classic papers distributed systems developers will find useful. [ABSTRACT FROM AUTHOR]

Graph Theory has become a fundamental field in computer science, playing a pivotal role in modeling, analyzing, and solving complex problems related to connectivity and relationships. In this research paper, we delve into the significance of Graph Theory and Network Analysis in computer science, examining its historical development, essential concepts, and applications across various domains. We explore how this mathematical framework has been employed to address real-world problems, from social networks to computer networks and beyond. This paper aims to highlight the essential role of Graph Theory and Network Analysis in the modern era of computer science and provide insights into its potential future directions. [ABSTRACT FROM AUTHOR]

Distributed computing, computer networking, and the Internet of Things (IoT) are all around us, yet only computer science and engineering majors learn the technologies that enable our modern lives. This paper introduces PhoneIoT, a mobile app that makes it possible to teach some of the basic concepts of distributed computation and networked sensing to novices. PhoneIoT turns mobile phones and tablets into IoT devices and makes it possible to create highly engaging projects through NetsBlox, an open-source block-based programming environment focused on teaching distributed computing at the high school level. PhoneIoT lets NetsBlox programs—running in the browser on the student's computer—access available sensors. Since phones have touchscreens, PhoneIoT also allows building a Graphical User Interface (GUI) remotely from NetsBlox, which can be set to trigger custom code written by the student via NetsBlox's message system. This approach enables students to create quite advanced distributed projects, such as turning their phone into a game controller or tracking their exercise on top of an interactive Google Maps background with just a few blocks of code. [ABSTRACT FROM AUTHOR]

Any number that can be uniquely determined by a graph is called graph invariants. During the most recent twenty years' innumerable numerical graph invariants have been described and used for correlation analysis. In the fast and advanced environment of manufacturing of networks and other products which used different networks, no dependable assessment has been embraced to choose, how much these invariants are connected with a network graph or molecular graph. In this paper, it will talk about three distinct variations of bridge networks with great capability of expectation in the field of computer science, chemistry, physics, drug industry, informatics, and mathematics in setting with physical and synthetic constructions and networks, since K-Banhatti invariants are newly introduced and have various forecast characteristics for various variations of bridge graphs or networks. The review settled the topology of bridge graph/networks of three unique sorts with three types of K-Banhatti Indices. These concluded outcomes can be utilized for the modeling of interconnection networks of Personal computers (PC), networks like Local area network (LAN), Metropolitan area network (MAN) and Wide area network (WAN), the spine of internet and different networks/designs of PCs, power generation interconnection, bio-informatics and chemical structures. [ABSTRACT FROM AUTHOR]

With the emergence of networked data, graph classification has received considerable interest during the past years. Most approaches to graph classification focus on designing effective kernels to compute similarities for static graphs. However, they become computationally intractable in terms of time and space when a graph is presented in an incremental fashion with continuous updates, i.e., insertions of nodes and edges. In this paper, we examine the problem of classification in large-scale and incrementally changing graphs. We propose a framework combining an incremental support vector machine (SVM) with theWeisfeiler-Lehman (W-L) graph kernel. By retaining the support vectors from each learning step, the classification model is incrementally updated whenever new changes are made to the graph. We design an entropy-based subgraph extraction strategy, that selects informative neighbor nodes and discards those with less discriminative power, to facilitate the classification of nodes in a dynamic network. We validate the advantages of our learning techniques by conducting an empirical evaluation on several large-scale real-world graph datasets in comparison with other graph classification methods. The experimental results also validate the benefits of our subgraph extraction method when combined with the incremental learning techniques. [ABSTRACT FROM AUTHOR]

The DCC linear congruential (DCCLC) graphs are a family of promising interconnection topologies. This paper addresses the conditional diagnosability of DCCLC graphs under the comparison model. We prove that, under reasonable assumptions, a 2t-regular DCCLC graph is conditionally [image omitted] -diagnosable. This result shows that DCCLC graphs possess strong self-diagnosing abilities. [ABSTRACT FROM AUTHOR]

The Panopticon (which means "watcher of everything") is a well-known prison structure of continuous surveillance and discipline studied by Bentham in 1785. Today, where persistent, massive scale, surveillance is immensely facilitated by new technologies, the term Panopticon vaguely characterizes institutions with a power to acquire and process, undetectably, personal information. In this paper we propose a theoretical framework for studying Panopticons and their detectability status. We show, based on the Theory of Computation, that detecting Panopticons, modelled either as a simple Turing Machine or as an Oracle Turing Machine, is an undecidable problem. Furthermore, we show that for each sufficiently expressive formal system, we can effectively construct a Turing Machine for which it is impossible to prove, within the formal system, its Panopticon status. Finally, we discuss how Panopticons can be physically detected by the heat they dissipate each time they acquire, effortlessly, information in the form of an oracle and we investigate their detectability status with respect to a more powerful computational model than classical Turing Machines, the Infinite Time Turing Machines (ITTMs). [ABSTRACT FROM AUTHOR]

Key-based circuit obfuscation or logic-locking is a technique that can be used to hide the full design of an integrated circuit from an untrusted foundry or end-user. The technique is based on creating ambiguity in the original circuit by inserting "key" input bits into the circuit such that the circuit is unintelligible absent a correct secret key. Clock signals have traditionally been avoided in locking in order to not corrupt the timing behavior of the locked circuit. In this paper, we explore the case where the clock signal itself may be obfuscated by ambiguating its frequency or pattern. Along with discussing formal notions of security in this context, we present practical ways to deobfuscate such designs using techniques from multi-rate model-checking. We present experimental data on deobfuscation runtime on a set of sequential benchmark circuits. Our results show that naive random clock obfuscation may not provide more security per overhead than traditional random keyed-gate insertion. We discuss how clock obfuscation may be a more attractive choice for special circuit designs that are inherently multi-clock/asynchronous. [ABSTRACT FROM AUTHOR]

The ever-increasing need for securing computing systems using cryptographic algorithms is spurring interest in the efficient implementation of common algorithms. While the algorithms can be implemented in software using base instruction sets, there is considerable potential to reduce memory cost and improve speed using specialized instructions and associated hardware. However, there is a need to assess the benefits and costs of software implementations and new instructions that implement key cryptographic algorithms in fewer cycles. The primary aim of this paper is to improve the understanding of the performance and cost of implementing cryptographic algorithms for the RISC-V instruction set architecture (ISA) in two cases: software implementations of the algorithms using the rv32i instruction set and using cryptographic instructions supported by dedicated hardware in additional functional units. For both cases, we describe a RISC-V processor with cryptography hardware extensions and hand-optimized RISC-V assembly language implementations of eleven cryptographic algorithms. Compared to implementations with only the rv32i instruction set, implementations with the cryptography set extension provide a 1.5× to 8.6× faster execution speed and 1.2× to 5.8× less program memory for five of the eleven algorithms. Based on our performance analyses, a new instruction is proposed to increase the implementation efficiency of the algorithms. [ABSTRACT FROM AUTHOR]

In today's world, the use of computer networks is everywhere, and to access the home network we use the Internet. IoT networks are the new range of these networks in which we try to connect different home appliances and try to give commands from a remote place. Access to any device over an insecure network invites various types of attacks. User authentication can be performed using some password or biometric technique. However, when it comes to authenticating a device, it becomes challenging to maintain data security over a secure network such as the Internet. Many encryptions and decryption algorithms assert confidentiality, and hash code or message authentication code MAC is used for authentication. Traditional cryptographic security methods are expensive in terms of computational resources such as memory, processing capacity, and power consumption. They are incompatible with the Internet of Things devices that have limited resources. Although automatic Device-to-Device communication enables new potential applications, the limited resources of the networks' machines and devices impose various constraints. This paper proposes a home device authentication scheme when these are accessed from a remote place. An authentication device is used for the home network and controller device to control home appliances. Our scheme can prevent various attacks such as replay attacks, server spoofing, and man-in-the-middle attack. The proposed scheme maintains the confidentiality and authenticity of the user and devices in the network. At the same time, we check the system in a simulated environment, and the results show that the network's performance does not degrade much in terms of delay, throughput, and energy consumed. [ABSTRACT FROM AUTHOR]

This special issue contains four papers selected from the 26th UK Performance Engineering Workshop (UKPEW), which was held during 8–9 July 2010 in the Department of Computer Science at the University of Warwick. UKPEW is the leading UK forum for the presentation of work relating to all aspects of performance modelling and the analysis of computer and telecommunication systems. This year's selected papers demonstrate the variety of topics on offer at UKPEW: performance issues in cloud computing, energy-aware routing in packet networks, source location privacy and multi-hop ad hoc networks for wireless networks. [ABSTRACT FROM AUTHOR]

The object deployment of a distributed software has a great impact on its performance. In this paper an analytical model for performance evaluation of different object deployments, is presented. The key advantage of the proposed model over the traditional Queuing Network models is the usefulness in the deployment optimization when the search space is huge and automatic instantiation of Queuing performance models corresponding to an object deployment is costly. Since our model produces an optimal deployment corresponding to each input load separately, the runtime behavior of the software corresponding to each input load should be profiled using simulation first. In this paper a translation scheme for generating the simulate-able Labeled Transition Systems (LTS) from scenarios is also presented. Moreover, two deployment algorithms (a GA-based and an INLP-based) are implemented and the results are compared. [ABSTRACT FROM AUTHOR]

This paper analyzes the black hole and gray hole attack which are the possible packet dropping attacks in wireless mesh networks. In a black hole attack, a malicious node makes all the traffic travel through it, claiming to have the shortest route to all other nodes in the network and instead of forwarding the packets, a malicious node simply drops it. In a gray hole attack (selective forwarding attack) where a misbehaving mesh router just forwards a subset of the packets it receives but drops the others. In this paper we have shown that there is 100% packet loss and there is rigorous decrease in throughput and network performance as compared to gray hole attack. Simulations are done using Qualnet 5.0. [ABSTRACT FROM AUTHOR]

The idea behind cloud computing is to deliver Infrastructure-, Platform- and Software-as-a-Service (IaaS, PaaS and SaaS) over the Internet on an easy pay-per-use business model. The Hochschule Furtwangen University (HFU) is running their own private cloud infrastructure, called Cloud Infrastructure and Application CloudIA. The targeted users of the CloudIA project are HFU staff and students running e-Learning applications, and external people for collaboration purposes. Therefore, in this paper, we introduce our work in building a private cloud. More specifically, this paper shows how our cloud offerings in each of the cloud service models, i.e. IaaS, PaaS and SaaS, address the requirements and needs of e-Learning and collaboration in an university environment. [ABSTRACT FROM AUTHOR]

Abstract  This paper emphasizes the importance of defining processes rigorously, completely, clearly, and in detail in order to support the complex projects that are essential to the modern world. The paper argues that such process definitions provide needed structure and context for the development of effective software systems. The centrality of process is argued by enumerating seven key ways in which processes and their definitions are expected to provide important benefits to society. The paper provides an example of a process formalism that makes good progress towards the difficult goal of being simultaneously rigorous, detailed, broad, and clear. Early experience suggests that these four key characteristics of this formalism do indeed seem to help it to support meeting the seven key benefits sought from process definitions. Additional research is suggested in order to gain more insights into needs in the area of process definition formalisms. [ABSTRACT FROM AUTHOR]

Abstract  This paper presents the saturation throughput analysis of IEEE 802.11g (ERP-OFDM) networks. The presented work is based on the Markov model previously introduced and validated by the authors in Szczypiorski and Lubacz (Lecture Notes in Computer Science, vol. 4516, pp. 1082–1093, Springer, [2007]). In the present paper the saturation throughput is evaluated in different channel conditions as a function of frame length. [ABSTRACT FROM AUTHOR]

Clock networks dissipate a significant fraction of the entire chip power budget. Therefore, the optimization for power consumption of clock networks has become one of the most important objectives in high performance IC designs. In contrast to most of the traditional studies that handle this problem with clock routing or buffer insertion strategy, this paper proposes a novel register clustering methodology in generating the leaf level topology of the clock tree to reduce the power consumption. Three register clustering algorithms called KMR, KSR and GSR are developed and a comprehensive study of them is discussed in this paper. Meanwhile, a buffer allocation algorithm is proposed to satisfy the slew constraint within the clusters at a minimum cost of power consumption. We integrate our algorithms into a classical clock tree synthesis (CTS) flow to test the register clustering methodology on ISPD 2010 benchmark circuits. Experimental results show that all the three register clustering algorithms achieve more than 20% reduction in power consumption without affecting the skew and the maximum latency of the clock tree. As the most effective method among the three algorithms, GSR algorithm achieves a 31% reduction in power consumption as well as a 4% reduction in skew and a 5% reduction in maximum latency. Moreover, the total runtime of the CTS flow with our register clustering algorithms is significantly reduced by almost an order of magnitude. [ABSTRACT FROM AUTHOR]

This bibliography evolved as a network using the papers in the volume Visualization of Scientific Computing edited by (Gregory, M. Nielson and Bruce Shriver and published by IEEE Computer Society. Press, 1990 as the root nodes. From there, the supplied reference lists were recursively traversed until a closure resulted either from the common links or from the effective grounding by the highly technical literature of application specializations. As usual, the standard disclaimers apply; so, for example, this collection is hopefully complete (in the sense that subsets of papers form research vectors that span the space of scientific visualization), but obviously not exhaustively comprehensive. Some of the entries are of a general survey nature, whereas others are quite specific and technical. Pivotal and often quoted works comprise the bulk of the material, but works of historical and developmental significance are also included especially where they point to researchers, research centres and journals where important work has been, and is being, performed and recorded. The annotations accompanying the references tend to be impressionistic and apologies to the authors are hereby noted for those instances where omissions, misunderstandings and whimsy have resulted in misinterpretations. The support of the U.S. Department of Energy is appreciated. [ABSTRACT FROM AUTHOR]

Performance modeling forms an essential process for evaluation of cloud quality. Cloud performance appraisal process and methods widely differ from that of other proven performance related methodologies being used for domains like computer networks, distributed computing and operations systems. Multi-tier Cloud is a scalable system in which many services or tiers can be constructed for all types of applications. The quality of service of a Multi-tier cloud environment is closely associated with several factors like dependability, availability, reliability, security, perform-ability and each of the performance entities directly or indirectly influences the overall functioning of the cloud. There are many models to evaluate cloud performance and quality, but these traditional models are not efficient enough and consider only certain primary parameters in their evaluation. In this paper, a high-level performance analysis model is proposed that can predict the availability of a Multi-tier cloud environment. As Multi-tier cloud deals with multiple services according to their application, the prediction of availability is essential one for performance modeling. The various prominent parameters that influence the performance of the cloud system are also considered in the proposed model. The proposed algorithm is experimentally verified by means of SHARPE tool. [ABSTRACT FROM PUBLISHER]

Bandwidth Estimation is an important issue in MANETs, because the path of the nodes in the network can change dynamically. Due to predefined infrastructure and bandwidth constraint the Quality of Service (QOS) is challenging assignment in Mobile Ad hoc network. In this paper we propose bandwidth estimation mechanisms using AODV and AOMDV protocol. The performance shows that increase packet delivery ratio and throughput and also reduce end - to - end delay. [ABSTRACT FROM AUTHOR]

Conventional dynamically scheduled processors often use fully associative structures named load/store queue (LSQ) to implement the value communication between loads and the older in-flight stores and to detect the store-load order violation. But this in-flight forwarding only occupies about 15% of all store-load communications, which makes the CAM-based micro-architecture the major bottleneck to scale store-load communication further. This paper presents a new micro-architecture named ASW (short for active store window). It provides a new structure named speculative active store window to implement more aggressively speculative store-load forwarding than conventional LSQ. This structure could forward the data of committed stores to the executing loads without accessing to L1 data cache, which is referred to as far forwarding in this paper. At the back-end of the pipeline, it uses in-order load re-execution filtered by the tagged SSBF (short for store sequence bloom filter) to verify the correctness of the store-load forwarding. The speculative active store window and tagged store sequence bloom filter are all set-associate structures that are more efficient and scalable than fully associative structures. Experiments show that this simpler and faster design outperforms a conventional load/store queue based design and the NoSQ design on most benchmarks by 10.22% and 8.71% respectively. [ABSTRACT FROM AUTHOR]

The Message-passing Interface (MPI) standard provides basic means for adaptations of the mapping of MPI process ranks to processing elements to better match the communication characteristics of applications to the capabilities of the underlying systems. The MPI process topology mechanism enables the MPI implementation to rerank processes by creating a new communicator that reflects user-supplied information about the application communication pattern. With the newly released MPI 2.2 version of the MPI standard, the process topology mechanism has been enhanced with new interfaces for scalable and informative user-specification of communication patterns. Applications with relatively static communication patterns are encouraged to take advantage of the mechanism whenever convenient by specifying their communication pattern to the MPI library. Reference implementations of the new mechanism can be expected to be readily available (and come at essentially no cost), but non-trivial implementations pose challenging problems for the MPI implementer. This paper is first and foremost addressed to application programmers wanting to use the new process topology interfaces. It explains the use and the motivation for the enhanced interfaces and the advantages gained even with a straightforward implementation. For the MPI implementer, the paper summarizes the main issues in the efficient implementation of the interface and explains the optimization problems that need to be (approximately) solved by a good MPI library. Copyright © 2010 John Wiley & Sons, Ltd. [ABSTRACT FROM AUTHOR]

This paper deals with the modeling of Free Space Optics (FSO) communication links using the software package "FSO SystSim", which was designed and implemented at KEMT FEI TUKE. Simulation of FSO communications links is of great importance in designing and understanding the context of such connection, depending on various parameters, both technical and constantly changing atmospheric parameters of the transmission optical channel. Paper briefly describes the statistical model used in this programming tool, and describes experiments carried out by the FSO SystSim. [ABSTRACT FROM AUTHOR]

In this paper, a dynamic wavelet network (DWN) is proposed and applied to identify black box models of the process. The well-known delta-rule is extended to the dynamic delta-rule in order to optimize wavelet network parameters. A chemical process was chosen as a realistic nonlinear system to demonstrate the identification performance. A comparison was made between the approach presented in this paper and dynamic multi layer perceptron neural networks. [ABSTRACT FROM AUTHOR]

The Internet contains thousands of Frequently Updated, Time-stamped, Structured (FUTS) data sources. This type of information represents a different class of information that is not properly handled by existing data management systems such as databases, data warehouses, search engines, pub-sub, event processing or information retrieval systems. In this position paper, we describe 9ticks, a system we are designing to collect, parse, store, query and disseminate FUTS information. 9ticks is helping us understand that all those steps raise new challenges but also bring new opportunities. In this paper, we summarize the challenges identified and present our vision of an end-to-end FUTS management system. [ABSTRACT FROM AUTHOR]

Abstract  Transformational approaches to generating design and implementation models from requirements can bring effectiveness and quality to software development. In this paper we present a framework and associated techniques to generate the process model of a service composition from a set of temporal business rules. Dedicated techniques including path-finding, branching structure identification and parallel structure identification are used for semi-automatically synthesizing the process model from the semantics-equivalent Finite State Automata of the rules. These process models naturally satisfy the prescribed behavioral constraints of the rules. With the domain knowledge encoded in the temporal business rules, an executable service composition program, e.g., a BPEL program, can be further generated from the process models. A running example in the e-business domain is used for illustrating our approach throughout this paper. [ABSTRACT FROM AUTHOR]

Efficient exact schedulability tests are required both for online admission of applications to dynamic systems and as an integral part of design tools for complex distributed real-time systems. This paper addresses performance issues with exact response time analysis (RTA) for fixed priority preemptive systems. Initial values are introduced that improve the efficiency of the standard RTA algorithm 1) when exact response times are required and 2) when only exact schedulability need be determined. This paper also explores modifications to the standard RTA algorithm, including the use of a response time upper bound to determine when exact analysis is needed, incremental computation aimed at faster convergence, and checking tasks in reverse priority order to identify unschedulable tasksets early. The various initial values and algorithm implementations are compared by means of experiments on a PC recording the number of iterations required and execution time measurements on a real-time embedded microprocessor. Recommendations are provided for engineers tasked with the problem of implementing exact schedulability tests as part of online acceptance tests and spare capacity allocation algorithms or as part of offline system design tools. [ABSTRACT FROM AUTHOR]