Five-level current-source inverters with buck-boost and inductive-current balancing capabilities

This paper presents new five-level current-source inverters (CSIs) with voltage/current buck-boost capability, unlike existing five-level CSIs where only voltage-boost operation is supported. The proposed inverters attain self-inductive-current-balancing per switching cycle at their dc front ends without having to include additional balancing hardware or complex control manipulation. The inverters can conveniently be controlled by using the well-established phase-shifted carrier modulation scheme with only two additional linear references and a mapping logic table needed. Existing modulators can therefore be conveniently retrofitted for controlling the presented inverters. By appropriately coordinating the inverter gating signals, their implementations can be realized by using the least number of components without degrading performance. These enhanced features of the inverters have already been verified in simulation and experimentally using a scaled-down laboratory platform.

Security and Privacy in Vehicular Ad-Hoc Networks : Survey and the Road Ahead

Vehicular Ad-hoc Networks (VANETs) can make roads safer, cleaner, and smarter. It can offer a wide range of services, which can be safety and non-safety related. Many safety-related VANETs applications are real-time and mission critical, which would require strict guarantee of security and reliability. Even non-safety related multimedia applications, which will play an important role in the future, will require security support. Lack of such security and privacy in VANETs is one of the key hindrances to the wide spread implementations of it. An insecure and unreliable VANET can be more dangerous than the system without VANET support. So it is essential to make sure that “life-critical safety” information is secure enough to rely on. Securing the VANETs along with appropriate protection of the privacy drivers or vehicle owners is a very challenging task. In this work we summarize the attacks, corresponding security requirements and challenges in VANETs. We also present the most popular generic security policies which are based on prevention as well detection methods. Many VANETs applications require system-wide security support rather than individual layer from the VANETs’ protocol stack. In this work we will review the existing works in the perspective of holistic approach of security. Finally, we will provide some possible future directions to achieve system-wide security as well as privacy-friendly security in VANETs.

Achieving enterprise integration through software customization : part II-enacting the strategy

In part 1 of this update, we put forward the argument that integration in ERP based environments can be achieved in ways other than adopting a software configuration only approach. We drew on evidence from two large ERP implementations to show how, despite the cost implications, some customization, if carefully managed, could prove helpful. In this, the final part of the update, we discuss the benefits, and potential pitfalls, involved in enacting a non-standard based integration strategy. This requires attention to a) broadening the integration definition; b) bringing legacy practices forward and c) developing a customization based integration strategy.

Governing virtual worlds : to what extent is it possible to empower players and preserve their rights in virtual worlds, and what is the best method of doing so?

In this paper the author considers the possibilities for establishing democratic governance in virtual worlds. He looks at the freedoms currently available to players in “Second Life”, contrasting these to those established in Raph Koster’s “A Declaration of the Rights of Avatars”, and assess whether some restrictions are more necessary in game spaces than social spaces. The author looks at the early implementations of self-governance in online spaces, and consider what lessons can be taken from these, investigating what a contemporary democratic space looks like, in the form of “A Tale in the Desert”, and finally considers how else we may think of giving players more rights in these developing social spaces.

Real-time decision making by driverless city vehicles : a discrete event driven approach

This thesis addresses the topic of real-time decision making by driverless (autonomous) city vehicles, i.e. their ability to make appropriate driving decisions in non-simplified urban traffic conditions. After addressing the state of research, and explaining the research question, the thesis presents solutions for the subcomponents which are relevant for decision making with respect to information input (World Model), information output (Driving Maneuvers), and the real-time decision making process. TheWorld Model is a software component developed to fulfill the purpose of collecting information from perception and communication subsystems, maintaining an up-to-date view of the vehicle’s environment, and providing the required input information to the Real-Time Decision Making subsystem in a well-defined, and structured way. The real-time decision making process consists of two consecutive stages. While the first decision making stage uses a Petri net to model the safetycritical selection of feasible driving maneuvers, the second stage uses Multiple Criteria Decision Making (MCDM) methods to select the most appropriate driving maneuver, focusing on fulfilling objectives related to efficiency and comfort. The complex task of autonomous driving is subdivided into subtasks, called driving maneuvers, which represent the output (i.e. decision alternatives) of the real-time decision making process. Driving maneuvers are considered as implementations of closed-loop control algorithms, each capable of maneuvering the autonomous vehicle in a specific traffic situation. Experimental tests in both a 3D simulation and real-world experiments attest that the developed approach is suitable to deal with the complexity of real-world urban traffic situations.

An observation about circular shortest paths: Dealing with additional constraints using branch and bound

Circular shortest paths represent a powerful methodology for image segmentation. The circularity condition ensures that the contour found by the algorithm is closed, a natural requirement for regular objects. Several implementations have been proposed in the past that either promise closure with high probability or ensure closure strictly, but with a mild computational efficiency handicap. Circularity can be viewed as a priori information that helps recover the correct object contour. Our "observation" is that circularity is only one among many possible constraints that can be imposed on shortest paths to guide them to a desirable solution. In this contribution, we illustrate this opportunity under a volume constraint but the concept is generally applicable. We also describe several adornments to the circular shortest path algorithm that proved useful in applications. © 2011 IEEE.

Error and variance bounds on sigmoidal neurons with weight and input errors

Bounds on the expectation and variance of errors at the output of a multilayer feedforward neural network with perturbed weights and inputs are derived. It is assumed that errors in weights and inputs to the network are statistically independent and small. The bounds obtained are applicable to both digital and analogue network implementations and are shown to be of practical value.

Side Channel Analysis of Some Hash Based MACs: A Response to SHA-3 Requirements

The forthcoming NIST’s Advanced Hash Standard (AHS) competition to select SHA-3 hash function requires that each candidate hash function submission must have at least one construction to support FIPS 198 HMAC application. As part of its evaluation, NIST is aiming to select either a candidate hash function which is more resistant to known side channel attacks (SCA) when plugged into HMAC, or that has an alternative MAC mode which is more resistant to known SCA than the other submitted alternatives. In response to this, we perform differential power analysis (DPA) on the possible smart card implementations of some of the recently proposed MAC alternatives to NMAC (a fully analyzed variant of HMAC) and HMAC algorithms and NMAC/HMAC versions of some recently proposed hash and compression function modes. We show that the recently proposed BNMAC and KMDP MAC schemes are even weaker than NMAC/HMAC against the DPA attacks, whereas multi-lane NMAC, EMD MAC and the keyed wide-pipe hash have similar security to NMAC against the DPA attacks. Our DPA attacks do not work on the NMAC setting of MDC-2, Grindahl and MAME compression functions.

Stability analysis and implementation of Power-Hardware-in-the-Loop for power system testing

This project develops the required guidelines to assure stable and accurate operation of Power-Hardware-in-the-Loop implementations. The proposals of this research have been theoretically analyzed and practically examined using a Real-Time Digital Simulator. In this research, the interaction between software simulated power network and the physical power system has been studied. The conditions for different operating regimes have been derived and the corresponding analyses have been presented.

A model for assessing information systems success and its application to e-logistics tracking systems

The DeLone and McLean (D&M) model (2003) has been broadly used and generally recognised as a useful model for gauging the success of IS implementations. However, it is not without limitations. In this study, we evaluate a model that extends the D&M model and attempts to address some of it slimitations by providing a more complete measurement model of systems success. To that end, we augment the D&M (2003) model and include three variables: business value, institutional trust, and future readiness. We propose that the addition of these variables allows systems success to be assessed at both the systems level and the business level. Consequently, we develop a measurement model rather than a structural or predictive model of systems success.

Efficiency of parallelisation of genetic algorithms in the data analysis context

Most real-life data analysis problems are difficult to solve using exact methods, due to the size of the datasets and the nature of the underlying mechanisms of the system under investigation. As datasets grow even larger, finding the balance between the quality of the approximation and the computing time of the heuristic becomes non-trivial. One solution is to consider parallel methods, and to use the increased computational power to perform a deeper exploration of the solution space in a similar time. It is, however, difficult to estimate a priori whether parallelisation will provide the expected improvement. In this paper we consider a well-known method, genetic algorithms, and evaluate on two distinct problem types the behaviour of the classic and parallel implementations.

Applying digital product memories in industrial production

Industrial production and supply chains face increased demands for mass customization and tightening regulations on the traceability of goods, leading to higher requirements concerning flexibility, adaptability, and transparency of processes. Technologies for the ’Internet of Things' such as smart products and semantic representations pave the way for future factories and supply chains to fulfill these challenging market demands. In this chapter a backend-independent approach for information exchange in open-loop production processes based on Digital Product Memories DPMs is presented. By storing order-related data directly on the item, relevant lifecycle information is attached to the product itself. In this way, information handover between several stages of the value chain with focus on the manufacturing phase of a product has been realized. In order to report best practices regarding the application of DPM in the domain of industrial production, system prototype implementations focusing on the use case of producing and handling a smart drug case are illustrated.

Proceedings of the Digital Cities 9 Workshop - Hackable Cities – From Subversive City Making to Systemic Change (Workshop) [Edited Proceedings]

The DC9 workshop takes place on June 27, 2015 in Limerick, Ireland and is titled “Hackable Cities: From Subversive City Making to Systemic Change”. The notion of “hacking” originates from the world of media technologies but is increasingly often being used for creative ideals and practices of city making. “City hacking” evokes more participatory, inclusive, decentralized, playful and subversive alternatives to often top-down ICT implementations in smart city making. However, these discourses about “hacking the city” are used ambiguously and are loaded with various ideological presumptions, which makes the term also problematic. For some “urban hacking” is about empowering citizens to organize around communal issues and perform aesthetic urban interventions. For others it raises questions about governance: what kind of “city hacks” should be encouraged or not, and who decides? Can city hacking be curated? For yet others, trendy participatory buzzwords like these are masquerades for deeply libertarian neoliberal values. Furthermore, a question is how “city hacking” may mature from the tactical level of smart and often playful interventions to the strategic level of enduring impact. The Digital Cities 9 workshop welcomes papers that explore the idea of “hackable city making” in constructive and critical ways.

An empirical analysis of the factors and measures of Enterprise Architecture Management success

Enterprise Architecture Management (EAM) is discussed in academia and industry as a vehicle to guide IT implementations, alignment, compliance assessment, or technology management. Still, a lack of knowledge prevails about how EAM can be successfully used, and how positive impact can be realized from EAM. To determine these factors, we identify EAM success factors and measures through literature reviews and exploratory interviews and propose a theoretical model that explains key factors and measures of EAM success. We test our model with data collected from a cross-sectional survey of 133 EAM practitioners. The results confirm the existence of an impact of four distinct EAM success factors, ‘EAM product quality’, ‘EAM infrastructure quality’, ‘EAM service delivery quality’, and ‘EAM organizational anchoring’, and two important EAM success measures, ‘intentions to use EAM’ and ‘Organizational and Project Benefits’ in a confirmatory analysis of the model. We found the construct ‘EAM organizational anchoring’ to be a core focal concept that mediated the effect of success factors such as ‘EAM infrastructure quality’ and ‘EAM service quality’ on the success measures. We also found that ‘EAM satisfaction’ was irrelevant to determining or measuring success. We discuss implications for theory and EAM practice.

Evaluation of Interconnect Fabrics for an Embedded MPSoC in 28 nm FD-SOI

Embedded many-core architectures contain dozens to hundreds of CPU cores that are connected via a highly scalable NoC interconnect. Our Multiprocessor-System-on-Chip CoreVAMPSoC combines the advantages of tightly coupled bus-based communication with the scalability of NoC approaches by adding a CPU cluster as an additional level of hierarchy. In this work, we analyze different cluster interconnect implementations with 8 to 32 CPUs and compare them in terms of resource requirements and performance to hierarchical NoCs approaches. Using 28nm FD-SOI technology the area requirement for 32 CPUs and AXI crossbar is 5.59mm2 including 23.61% for the interconnect at a clock frequency of 830 MHz. In comparison, a hierarchical MPSoC with 4 CPU cluster and 8 CPUs in each cluster requires only 4.83mm2 including 11.61% for the interconnect. To evaluate the performance, we use a compiler for streaming applications to map programs to the different MPSoC configurations. We use this approach for a design-space exploration to find the most efficient architecture and partitioning for an application.