ppxscal/embedding_network huggingface dataset:
Artificial intelligence-based real time controllers for industrial drives
Authors: Ahmed Rubaai
Venue:  (2007)

This research work deals with the development and implementation of intelligent controllers, which are particularly suitable for high performance industrial drives. Two distinct multilayer percepton neural networks (NNs) are implemented via laboratory experiment to simultaneously identify and adaptively control the trajectory tracking of a hybrid step motor assumed to operate in a high-performance drives environment. That is, a neural network identifier (NNI) which captures the nonlinear dynamics of the stepper motor drive system over any arbitrary time interval in its range of operation, and a neural network controller (NNC) to provide the necessary control actions as to achieve trajectory tracking of the rotor speed. The exact form of the control law is unknown, and must be estimated by the NNC. Consequently, the NNC is constructed as a nonlinear unknown function depending on the current sate of the drive system supplies by the NNI and the reference trajectory we wish the outputs to follow. A real-time implementation of hybrid fuzzy-PID controller-based genetic optimization using a state-of-the-art dSPACE DS1104 DSP-based data acquisition and control (DAC) system in a laboratory 1-hp brushless motor drive system is demonstrated. Both the design of fuzzy-PID controller and its integration with the conventional PID in global control system to produce a hybrid design is established. A genetic optimization technique is used to determine the optimal values of the scaling factors of the output variables of the fuzzy-PID controller. As part of this research work an on-line trained fuzzy-neural-network structure is also developed and implemented for speed trajectory tracking of a brushless drive system. The architecture is basically composed of three parallel neural-fuzzy-PID sub-controllers. A genetic algorithm is used to search for the optimal values of the scaling factors, while, the Widrow-Hoff learning rule is used to adaptively update the parameters of the neural-fuzzy-PID sub-controllers.
Operating System Models in a Concurrent Pascal Environment: Complexity and Performance Considerations
Authors: A. Pashtan
Venue: IEEE Transactions on Software Engineering (1985)

Empirical observations of computer operating systems have shown that operating systems are designed with one of two object oriented strategies: a process or a monitor oriented approach. This paper compares the two design approaches in a Concurrent Pascal environment. Resource manager programs that are implemented in conformity with each model are evaluated using software complexity measures and program performance measures. The average complexity of resource manager processes is 94 percent larger than the average complexity of resource manager monitors. The runtime synchronization overhead of the process model program is two-eight times higher than that of its counterpart.
Using Static Analysis to Find Bugs
Authors: Nathaniel Ayewah, David Hovemeyer, J. David Morgenthaler, John Penix, William Pugh
Venue: IEEE Software (2008)

Static analysis examines code in the absence of input data and without running the code. It can detect potential security violations (SQL injection), runtime errors (dereferencing a null pointer) and logical inconsistencies (a conditional test that can't possibly be true). Although a rich body of literature exists on algorithms and analytical frameworks used by such tools, reports describing experiences in industry are much harder to come by. The authors describe FindBugs, an open source static-analysis tool for Java, and experiences using it in production settings. FindBugs evaluates what kinds of defects can be effectively detected with relatively simple techniques and helps developers understand how to incorporate such tools into software development.
Introducing a Public Agency Networking Platform towards Supporting Connected Governance
Authors: Alexandros Dais, Mara Nikolaidou, Nancy Alexopoulou, Dimosthenis Anagnostopoulos
Venue: Proceedings of the 7th international conference on Electronic Government (2008)

Connected governance constitutes the current trend regarding the provision of electronic governmental services. In the connected governance paradigm, public agencies share objectives across organizational boundaries, as opposed to working solely supporting autonomous portals in the e-government era. The establishment of connected governance poses new requirements, such as cross-organizational connectivity as well as back-office to front-office integration. Towards supporting this concept, we propose a Public Agency Networking Platform (PANP) facilitating personalized cross-organizational services, based on the concept of life events which represent human situations that trigger public services. The key feature of the platform is the simplification of the process execution workflow, as life events are accomplished through a user orchestrated process combining the functionality of discrete public agency applications. Emphasis has been laid on the citizen data protection by adopting a profile mechanism that enables the citizen to administer his/her own data loaded in his/her profile.
Melting transition in rotating sodium clusters
Authors: Andrés Aguado, José M. López
Venue: Journal of Computational Methods in Sciences and Engineering (2007)

We investigate the possible influence of a global cluster rotation on the melting-like transition of Na$_{30}$, Na$_{55}$ and Na$_{147}$, by means of orbital-free density-functional molecular dynamics simulations. The results reveal that very large angular momenta &Lvec; are needed to significantly alter the results of simulations performed on nonrotating clusters, and therefore validate the usual L=0 approximation made in computer simulations of cluster thermal properties. However, a global rotation might have a more profound influence on the thermal properties in the limit of very small cluster sizes, when the ratio of rotational to vibrational degrees of freedom is not negligible. For those clusters which are in a highly excited rotational state, we find enhanced isomerization rates and even depressed melting points.
On a Quest for Good Process Models: The Cross-Connectivity Metric
Authors: Irene Vanderfeesten, Hajo A. Reijers, Jan Mendling, Wil M. Aalst, Jorge Cardoso
Venue: Proceedings of the 20th international conference on Advanced Information Systems Engineering (2008)

Business process modeling is an important corporate activity, but the understanding of what constitutes good process models is rather limited. In this paper, we turn to the cognitive dimensions framework and identify the understanding of the structural relationship between any pair of model elements as a hard mental operation. Based on the weakest-link metaphor, we introduce the cross-connectivity metric that measures the strength of the links between process model elements. The definition of this new metric builds on the hypothesis that process models are easier understood and contain less errors if they have a high cross-connectivity. We undertake a thorough empirical evaluation to test this hypothesis and present our findings. The good performance of this novel metric underlines the importance of cognitive research for advancing the field of process model measurement.
A hierarchical compositional model for representation and sketching of high-resolution human images
Authors: Song-Chun Zhu
Venue:  (2007)

This dissertation presents a composite template model, named And-Or graph for representing objects with large structural variabilities. Intuitively, an And-node represents a decomposition of certain graphical structures which expands to a set of Or-nodes with associated relations; an Or-node serves as a set of switch variable pointing to alternative And-nodes. A traversal from the root node of the And-Or graph, named the parse graph, produces a configuration of the terminal nodes (sub-templates) under (soft and hard) relations inherited from their ancestor nodes. The And-Or graph representation can generate a large set of constrained configurations with relatively small number of graph nodes, thus account for great structural variations. The And-Or graph model is tested on tasks as modeling and sketching human faces and clothes. A hierarchical-compositional model of human faces, as a three-layer And-Or graph is built. Faces are represented hierarchically: the first layer treats each face as a whole; the second layer refines the local facial parts jointly as a set of individual templates; the third layer further divides face into 16 zones and models detail facial features such as eye corners, marks or wrinkles. Transitions between the layers are realized by measuring the minimum description length (MDL) given the complexity of an input face image. Diverse face representations are formed by drawing from dictionaries of global faces, parts and skin detail features. A sketch captures the most informative part of a face in a much more concise and potentially robust representation. However, generating good facial sketches is extremely challenging because of the rich facial details and large structural variations, especially in the high-resolution images. The representing power of our generative model is demonstrated by reconstructing high-resolution face images and generating the cartoon facial sketches. Our model is useful for a wide variety of applications, including recognition, non-photorealistic rendering, super-resolution, and low-bit rate face coding. Cloth modeling and recognition is an important and challenging problem in both vision and graphics tasks, such as dressed human recognition and tracking, human sketch and portrait. We built a And-Or graph model to represent different clothes configurations, such as T-shirts, jackets, etc. In a supervised learning phase, we ask an artist to draw sketches on a set of dressed people, and we decompose the sketches into categories of cloth and body components: collars, shoulders, cuff, hands, pants, shoes, etc. Each component has a number of distinct sub-templates (sub-graphs). An algorithm which integrates the bottom-up proposals and the top-down information is proposed to infer the composite clothes template efficiently from the image.
A decision support system for designing new services tailored to citizen profiles in a complex and distributed e-government scenario
Authors: Pasquale De Meo, Giovanni Quattrone, Domenico Ursino
Venue: Data Knowledge Engineering (2008)

In this paper, we propose a new system aiming to support government agency decision makers to design new services tailored to citizen profiles in a complex and distributed e-government scenario. Specifically, our system assists government agency managers, who plan to activate new services, to identify those citizens who could gain the highest benefit from each of them. Managers can, then, exploit this information to decide what services should be activated and how they can be tailored to citizen needs and desires. Our system can handle more government agencies and a great number of citizens simultaneously; as a consequence, it is well suited for a complex e-government scenario. This paper first illustrates the proposed system; after this, it reports various experimental results; finally, it presents a comparison between our system and other related ones already presented in the literature.
A Course of Study in Computer Hardware Architecture
Authors: G. E. Rossmann
Venue: Computer (1975)

The subject of computer architecture as currently taught in most computer engineering and computer science programs is a mixture of architectural principles, organizational strategies, and implementation techniques. This blurring of the hierarchy of system levels that characterize the structure of a computer has made it very difficult for students ( and. often instructors as well) to determine what were the forces that led to the design decisions they have seen reflected in machines.
Robust Intelligent Systems, 1 edition
Authors: Alfons Schuster
Venue:  (2008)

Using artificial intelligence and robustness as a unifying theme, this book comments on the fundamental strategies found in nature (such as redundancy, granularity, adaptation, repair, self-healing, etc.), and how an understanding of these can be used to further research into general design principles for artificial intelligence in the context of a diverse range of modern research areas and systems (including pervasive computing, autonomic computing, ambient intelligence, bioinformatics and others). Contributions from experts in the field provide an invaluable insight into a variety of cutting-edge research areas using artificial intelligence and robustness as the central theme. Practitioners in various fields will gain an insight into the important role robustness plays in natural and artificial systems in general, and in artificial intelligence in particular.
Leveraging Source Code Search for Reuse
Authors: Hans-Jörg Happel, Thomas Schuster, Peter Szulman
Venue: Proceedings of the 10th international conference on Software Reuse: High Confidence Software Reuse in Large Systems (2008)

The importance of search as a central support activity for information handling and software reuse has been highlighted by several authors. Although it is one of the most dominant daily activities of developers, it is not a first order concern of most development tools. Recently a number of specialized search engines for source code emerged that enable access to reusable assets from both the web and within organizations. We argue that those source code search engines can play a key role for information access throughout the software development lifecycle. In this paper we present an analysis of existing approaches and tools. Furthermore we point out several shortcomings and provide a roadmap for future enhancements.
Adaptive CSMA/CD: an improved MAC protocol
Authors: S. Silakari, Piyush Kumar Shukla, Ujjwal Nigam, Anuj Garg
Venue: Proceedings of the American Conference on Applied Mathematics (2008)

The challenge of designing an efficient Medium Access Control (MAC) protocol and analyzing it has been an important research topic for over 30 years. This paper focuses on the performance analysis (through simulation) and modification of a well known MAC protocol CSMA/CD. The existing protocol does not consider the wastage of bandwidth due to unutilized periods of the channel. By considering this fact, performance of MAC protocol can be enhanced. The purpose of this work is to modify the existing protocol by enabling it to adapt according to state of the network. The modified protocol takes appropriate action whenever unutilized periods detected. In this way, to increase the effective bandwidth utilization and determine how it behaves under increasing load, and varying packet sizes.
Exploring memory in email refinding
Authors: David Elsweiler, Mark Baillie, Ian Ruthven
Venue: ACM Transactions on Information Systems (TOIS) (2008)

Human memory plays an important role in personal information management (PIM). Several scholars have noted that people refind information based on what they remember and it has been shown that people adapt their management strategies to compensate for the limitations of memory. Nevertheless, little is known about what people tend to remember about their personal information and how they use their memories to refind. The aim of this article is to increase our understanding of the role that memory plays in the process of refinding personal information. Concentrating on email re-finding, we report on a user study that investigates what attributes of email messages participants remember when trying to refind. We look at how the attributes change in different scenarios and examine the factors which impact on what is remembered.
Semantic Based Substitution of Unsupported Access Points in the Library Meta-search Environments
Authors: Michalis Sfakakis, Sarantos Kapidakis
Venue: Proceedings of the 12th European conference on Research and Advanced Technology for Digital Libraries (2008)

Meta-searching library communities involve access to sources where metadata are invisible behind query interfaces. Many of the query interfaces utilize predefined abstract Access Points for the implementation of the search services, without any further access to the underlining meta-data and query methods. The existence of unsupported Access Points and its consequences, which are either query failures or inconsistent query answers, creates a major issue when meta-searching this kind of systems. An example of the abstract Access Point based search model is the Z39.50 information retrieval protocol, which is widely used by the library community. In this paper we present the zSAPN (Z39.50 Semantic Access Point Network), a system which improves the search consistency and eliminates the query failures by exploiting the semantic information of the Access Points from an RDFS description. The current implementation of zSAPN is in the context of the Z39.50 protocol, using the official specification of the Access Point semantics and can benefit the huge number of the available sources worldwide. zSAPN substitutes each unsupported Access Point with a set of other supported ones, whose appropriate combination would either broaden or narrow the initial semantics, according to the user's choice. Finally, we estimate the impact of the modification of the initial semantics during the substitution process to the precision or the recall of the original query, with the unsupported Access Point.
A New Multi-objective Evolutionary Optimisation Algorithm: The Two-Archive Algorithm
Authors: Kata Praditwong, Xin Yao
Venue: Computational Intelligence and Security: International Conference, CIS 2006, Guangzhou, China, November 3-6, 2006, Revised Selected Papers (2007)

Many Multi-Objective Evolutionary Algorithms (MOEAs) have been proposed in recent years. However, almost all MOEAs have been evaluated on problems with two to four objectives only. It is unclear how well these MOEAs will perform on problems with a large number of objectives. Our preliminary study [1] showed that performance of some MOEAs deteriorates significantly as the number of objectives increases. This paper proposes a new MOEA that performs well on problems with a large number of objectives. The new algorithm separates non-dominated solutions into two archives, and is thus called the Two-Archive algorithm. The two archives focused on convergence and diversity, respectively, in optimisation. Computational studies have been carried out to evaluate and compare our new algorithm against the best MOEA for problems with a large number of objectives. Our experimental results have shown that the Two-Archive algorithm outperforms existing MOEAs on problems with a large number of objectives.
Comparison of the Cross Deleted Wigner Representation and the Matching Pursuit Distribution (Via Adaptive Signal Decomposition)
Authors: S. Ghofrani, D. C. Mclernnon
Venue: Proceedings of the 3rd international conference on Image and Signal Processing (2008)

The cross-deleted Wigner representation (CDWR) suppresses the cross terms present in the Wigner distribution of a multi-component signal by decomposing the Wigner distribution (via the Gabor expansion) into terms that affect the auto- and cross-terms. The Matching Pursuit (MP) distribution is also a time-frequency representation that is devoid of cross terms. In this paper we decompose a signal by both the Gabor expansion and MP. Then the CDWR and the MP distribution are obtained. We then compare and contrast both representations (along with the original Wigner-Ville distribution (WVD)) with respect to (i) concentration/resolution, (ii) noise reduction capabilities and (iii) frequency and time resolvability.
Covering Arrays Avoiding Forbidden Edges
Authors: Peter Danziger, Eric Mendelsohn, Lucia Moura, Brett Stevens
Venue: Proceedings of the 2nd international conference on Combinatorial Optimization and Applications (2008)

Covering arrays (CAs) can be used to detect the existence of faulty pairwise interactions between parameters or components in a software system. The generalization considered here applies to the situation in which some input combinations are invalid. In this paper, we study covering arrays avoiding forbidden edges (CAFEs), where certain pairwise interactions are forbidden while all others must be covered. We study the complexity of the problem and give an algorithm for the case of binary alphabets.
Structured Parallel Programming: How Informatics Can Help Overcome the Software Dilemma
Authors: Helmar Burkhart, Robert Frank, Guido HÄCHLER
Venue: Scientific Programming (1996)

The state-of-the-art programming of parallel computers is far from being successful. The main challenge today is, therefore, the development of techniques and tools that improve programmers' productivity. Programmability, portability, and reusability are key issues to be solved. In this article we shall report about our ongoing efforts in this direction. After a short discussion of the software dilemma found today, we shall present the Basel approach. We shall summarize our algorithm description methodology and discuss the basic concepts of the proposed skeleton language. An algorithmic example and comments on implementation aspects will explain our work in more detail. We shall summarize the current state of the implementation and conclude with a discussion of related work.
Human behavior recognition using unconscious cameras and a visible robot in a network robot system
Authors: Keiichi Kemmotsu, Yoshihiro Koketsu, Masato Iehara
Venue: Robotics and Autonomous Systems (2008)

We developed a network robot system integrating various types of robots via ubiquitous networks that introduce an interactive robot into areas in which people are located. In this paper, we present a human behavior recognition method necessary for providing guidance in a public space, which uses a tangible network robot system composed of a mobile robot and vision sensors embedded in an environment. We define some basic features that a person typically exhibits when in need of guidance. Various human behaviors were successfully interpreted by first recognizing the basic features and then forming their different combinations.
Study of Game Scheme for Elementary Historical Education
Authors: Haiyan Wu, Xun Wang
Venue: Proceedings of the 3rd international conference on Technologies for E-Learning and Digital Entertainment (2008)

It is important for development of education game to get the correct balance and find the best hybrid mode between education and game. In this paper, the factor considered during the design of education game is discussed, and several hybrid modes of education and game are proposed. Specifically for elementary historical education, the paper research on education game scheme of network role-play from the perspective of educational psychology, and design a case of historical education game using RPG mode with fully considering of knowledge and education. Players experience history by historical role-play, convey the sentiment of history by communication of players, and do with the hybrid integration of the game and education.