ppxscal/embedding_network huggingface dataset:
A new co-mutation genetic operator
Authors: Florin Stoica, Dana Simian, Corina Simian
Venue: Proceedings of the 9th WSEAS International Conference on Evolutionary Computing (2008)

A new co-mutation operator called LR-Mijn, capable of operating on a set of adjacent bits in one single step is introduced. Its properties are examined and compared against those of the Mijn operator intoduced in [3]. A simple Evolutionary Algorithm is described which is based only on selection and LR-Mijn. This algorithm is used for the optimization of some well-known benchmark functions and its performance is compared against that offered by algorithms using the Mijn operator. The obtained results prove the effectiveness of the new LR-Mijn operator.
Handling of Task Hierarchies on the Nepomuk Social Semantic Desktop
Authors: Marko Brunzel, Roland M. Mueller
Venue: Proceedings of the 10th international conference on Visual Information Systems: Web-Based Visual Information Search and Management (2008)

The idea of the Semantic Web is becoming more and more reality. Recent developments in Semantic Desktop research bring semantically enriched data onto the knowledge workers desktop environment. A crucial application for today's knowledge worker is task management, which goes beyond simple ToDo lists.In this paper we explain why task management applications in social semantic environments need an appropriate user interface to take advantage of the opportunities ahead. Then we propose the usage of an UI which is tailored towards the underlying data schema: the task management ontology.One challenge for task management based on flexible semantic schemas in social environments is to scope on what should be shared and what not. Sharing and transfer of semantic, graph-represented information is highly desired. We propose WYSIWYS: What You See Is What You Share. This paradigm gives the human user an interface where he/she maintains control over what is shared and what not.
Organisational change through influence
Authors: Mairi Mccallum, Wamberto W. Vasconcelos, Timothy J. Norman
Venue: Autonomous Agents and Multi-Agent Systems (2008)

Influence is a phenomenon underpinning many types of interactions in both human and artificial organisations, and has a significant impact on the operation of the organisation. If influence can be examined at the organisational level, instead of at the level of the agents involved, engineers can better understand an organisation's robustness to structural, behavioural and population changes. In this paper we present the Model of Organisational Change using Agents (MOChA) as a means to formally specify, check and simulate organisations using agents, particularly with a view to determining the impact of influence on the operation of an organisation. This formalisation of influence is not specific to our model, and is relevant and adaptable to any organisational model in which explicit relationships among roles of agents are formed.
RFID: An Ideal Technology for Ubiquitous Computing?
Authors: Ciaran O'Driscoll, Daniel Maccormac, Mark Deegan, Fred Mtenzi, Brendan O'Shea
Venue: Proceedings of the 5th international conference on Ubiquitous Intelligence and Computing (2008)

This paper presents a review of RFID based approaches used for the development of smart spaces and smart objects. We explore approaches that enable RFID technology to make the transition from the recognized applications such as retail to ubiquitous computing, in which computers and technology fade into the background of day to day life. In this paper we present the case for the use of RFID technology as a key technology of ubiquitous computing due to its ability to embed itself in everday objects and spaces. Frameworks to support the operation of RFID-based smart objects and spaces are discussed and key design concepts identified. Conceptual frameworks, based on academic research, and deployed frameworks based on real world implementations are reviewed and the potential for RFID as a truly ubiquitous technology is considered and presented.
Theater Improvisers Know the Requirements Game
Authors: Martin Mahaux, Neil Maiden
Venue: IEEE Software (2008)

This article introduces improvisational theater, or improv, to support team-based innovation in requirements processes. It proposes improv to help workshop participants develop requirements soft skills through practice and play. The authors describe and demonstrate different improv techniques with simple examples, then advise readers on how to introduce them into requirements projects.
Hardware Implementation Aspects of New Low Complexity Image Coding Algorithm for Wireless Capsule Endoscopy
Authors: Paweł Turcza, Tomasz Zieliński, Mariusz Duplaga
Venue: Proceedings of the 8th international conference on Computational Science, Part I (2008)

The paper presents hardware implementation aspects of new efficient image compression algorithm designed for wireless capsule endoscopy with Bayer color filter array (CFA). Since power limitation, small size conditions and specific image data format (CFA) exclude application of traditional image compression techniques dedicated ones are necessary. Discussed algorithm is based on integer version of discrete cosine transform (DCT). Therefore it has low complexity and power consumption. It is demonstrated that the perfor-mance of proposed algorithm is comparable to the performance of JPEG2000 --- very complex, sophisticated wavelet based coder. In the paper a VLSI coder architecture is proposed and power requirements are discussed.
The Application of ISO 9001 to Agile Software Development
Authors: Tor Stålhane, Geir Kjetil Hanssen
Venue: Proceedings of the 9th international conference on Product-Focused Software Process Improvement (2008)

In this paper we discuss how to reconcile agile development's focus on speed and lean development with ISO 9001's need for documentation, traceability and control. We see no need to change neither ISO 9001 nor the agile concept. Instead, we see a need to be flexible when using terms such as planning and evidence of conformance. It is true that we can include everything in agile development by making it a requirement but there is a limit to how many documents we can require from an agile process without destroying the very concept of agility.
Parallel Reinforcement Learning for Weighted Multi-criteria Model with Adaptive Margin
Authors: Kazuyuki Hiraoka, Manabu Yoshida, Taketoshi Mishima
Venue: Neural Information Processing: 14th International Conference, ICONIP 2007, Kitakyushu, Japan, November 13-16, 2007, Revised Selected Papers, Part I (2007)

Reinforcement learning (RL) for a linear family of tasks is studied in this paper. The key of our discussion is nonlinearity of the optimal solution even if the task family is linear; we cannot obtain the optimal policy by a naive approach. Though there exists an algorithm for calculating the equivalent result to Q-learning for each task all together, it has a problem with explosion of set sizes. We introduce adaptive margins to overcome this difficulty.
Implementation of an Obfuscation Tool for C/C++ Source Code Protection on the XScale Architecture
Authors: Seongje Cho, Hyeyoung Chang, Yookun Cho
Venue: Proceedings of the 6th IFIP WG 10.2 international workshop on Software Technologies for Embedded and Ubiquitous Systems (2008)

Obfuscation is one of the most effective methods to protect software against malicious reverse engineering intentionally making the code more complex and confusing. In this paper, we implement and evaluate an obfuscation tool, or obfuscator for protecting the intellectual property of C/C++ source code. That is, this paper presents an implementation of a code obfuscator, a tool which transforms a C/C++ source program into an equivalent one that is much harder to understand. We have used the ANTRL parser generator for parsing C/C++ programs, and applied some obfuscation algorithms. Performance analysis is conducted by executing two obfuscated programs on the XScale architecture to establish the relationship between the complexity and the performance of each program. When the obfuscated source code has been compared with the original source code, it has enough effectiveness in terms of potency and resilience though it incurs some run-time overhead.
An Improved System Cloud Grey Neural Network Model
Authors: Sikun Yang
Venue: Proceedings of the 2008 Second International Conference on Genetic and Evolutionary Computing (2008)

This paper improved and optimized the topology structure of the system cloud grey neural network model (SCGNNM (1,1)) and presented a novel SCGNNM (1,1) based on time response model. Because the dispersed data of time response model can be regarded as the data abstracted from the continued function, the model's precision can be improved greatly. Meantime, the learning algorithm is given. Finally, the proposed model is simulated and shown to be very reliable.
Persuasion in Knowledge-Based Recommendation
Authors: Alexander Felfernig, Bartosz Gula, Gerhard Leitner, Marco Maier, Rudolf Melcher, Erich Teppan
Venue: Proceedings of the 3rd international conference on Persuasive Technology (2008)

Recommendation technologies support users in the identification of interesting products and services. Beside the wide-spread approaches of collaborative and content-based filtering, knowledge-based recommender technologies gain an increasing importance due to their capability of deriving recommendations for complex products such as financial services, technical equipment, or consumer goods. The identification of best-fitting products is in many cases a complex decision making task which forces users to fall back to different types of decision heuristics. This phenomenon is explained by the theory of bounded rationality of users which is due to their limited knowledge and computational capacity. Specifically in the context of recommender applications bounded rationality acts as a door opener for different types of persuasive concepts which can influence a user's attitudes (e.g., in terms of product preferences) and behavior (e.g., in terms of buying behavior). The major goal of this paper is to provide an overview of such persuasive aspects and possible formalizations in knowledge-based recommender systems.
Pseudonymous Mobile Identity Architecture Based on Government-Supported PKI
Authors: Konstantin Hyppönen, Marko Hassinen, Elena Trichina
Venue: Proceedings of the 1st international conference on Trusted Computing and Trust in Information Technologies: Trusted Computing - Challenges and Applications (2008)

An electronic ID scheme must be usable in a wide range of circumstances, especially in ordinary situations, such as proving your right to a concession ticket on a bus. One of the problems to be addressed is privacy. Indeed, when documents are read by electronic means, a lot of information is not only revealed, but can be copied, stored and processed without our consent. Another issue is ubiquity, reliability and acceptance of the involved technology. In this paper we attempt to address these issues by combining an officially recognised national mobile e-ID infrastructure with identification procedures based on controlled identity revelation. We report a prototype implementation of an identity tool on a mobile phone with a PKI-SIM card.
Magnitude Approximations for Microprocessor Implementation
Authors: W. Adans, John Brady
Venue: IEEE Micro (1983)

Several methods for approximating the exact calculation of the magnitude of quadrature components are faster, and require smaller programs, than the exact methods themselves.
Transparent government: Parliamentary and legal accountability in an information age
Authors: Albert Jacob Meijer
Venue: Information Polity (2003)

There are several indications that the (long-term) memory of electronic government is in danger and that this decline in organizational memory may have important negative effects on accountability. Case study research in the Netherlands, however, highlights the positive effects of the use of information and communication technologies for parliamentary and legal accountability. Although technological safeguards for authenticity may be lacking and data may not always be preserved in a durable way, parliamentary and legal fact-finding is generally facilitated. The use of ICTs leads to more informational and analytical transparency of government organizations: more data is recorded and there are also more ways to retrieve this data. This increased transparency is an unintentional effect of efforts to improve the support and management of business processes.
Virtual Camera Composition with Particle Swarm Optimization
Authors: Paolo Burelli, Luca Gaspero, Andrea Ermetici, Roberto Ranon
Venue: Proceedings of the 9th international symposium on Smart Graphics (2008)

The Virtual Camera Composition (VCC) problem consists in automatically positioning a camera in a virtual world, such that the resulting image satisfies a set of visual cinematographic properties [3]. In this paper, we propose an approach to VCC based on Particle Swarm Optimization [5]. We show, in realistic situations, that our approach outperforms a discretized, exhaustive search method similar to a proposal by Bares et al [1].
Flexible Analysis of User Actions in Heterogeneous Distributed Learning Environments
Authors: Lars Bollen, Adam Giemza, H. Ulrich Hoppe
Venue: Proceedings of the 3rd European conference on Technology Enhanced Learning: Times of Convergence: Technologies Across Learning Contexts (2008)

In this paper, we describe an architectural framework for the engineering of distributed learning environments with different devices and multi-language agent support. The framework consists of a central Tuple Space server and clients that differ in hardware (PDAs, PCs with projection) and in programming languages (C#, Prolog, Java). The analysis components use state patterns and action patterns to be defined in and interpreted by Prolog. This framework has been used for supporting the design rationale method QOC in a collaborative visual modelling environment.
Acting, Events and Actions
Authors: Mark A. Brown
Venue: Proceedings of the 9th international conference on Deontic Logic in Computer Science (2008)

A logic of action is essential for many treatments of normative concerns, but most treatments either ignore the role of agents, as in PDL, or omit all possibility of naming actions, as in various versions of stit theory. Moreover, most treatments of either type do not attempt to provide an account of what actions are, in a way that would distinguish actions from other processes or events. In this paper, I explore an account of actions as a species of events, with events interpreted against a background of the logic of branching time. This opens a new approach to exploring the relations between logics of personal action (e.g. Belnap's and Horty's stit theories) and impersonal logics of actions such as PDL, and offers some prospect of a deontic logic which integrates tunsollen (ought to do) into a system of seinsollen (ought to be). The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Improving Depth Resolution of Diffuse Optical Tomography with Intelligent Method
Authors: Hai-Jing Niu, Ping Guo, Tian-Zi Jiang
Venue: Proceedings of the 4th international conference on Intelligent Computing: Advanced Intelligent Computing Theories and Applications - with Aspects of Theoretical and Methodological Issues (2008)

Near-infrared diffuse optical tomography imaging (DOT) suffers from a poor depth resolution due to the depth sensitivity decreases markedly in tissues. In this paper, an intelligent method, which is called layered maximum-singular-values adjustment (LMA), is proposed to compensate the decrease of sensitivity in depth dimension, and hence obtain improved depth resolution of DOT imaging. Simulations are performed with a semi-infinite model, and the simulated results for objects located in different depths demonstrate that the LMA technique can improve significantly the depth resolution of reconstructed objects. The positional errors of less than 3 mm can be obtained in the depth dimension for all depths from -1 cm to -3 cm.
On Recovering Syntenic Blocks from Comparative Maps
Authors: Zhixiang Chen, Bin Fu, Minghui Jiang, Binhai Zhu
Venue: Proceedings of the 2nd international conference on Combinatorial Optimization and Applications (2008)

A genomic map is represented by a sequence of gene markers, and a gene marker can appear in several different genomic maps, in either positive or negative form. A strip (syntenic block) is a sequence of distinct markers that appears as subsequences in two or more maps, either directly or in reversed and negated form. Given two genomic maps G and H, the problem Maximal Strip Recovery (MSR) is to find two subsequences G¿ and H¿ of G and H, respectively, such that the total length of disjoint strips in G¿ and H¿ is maximized. Previously only a heuristic was provided for this problem, which does not guarantee finding the optimal solution, and it was unknown whether the problem is NP-complete or polynomially solvable. In this paper, we develop a factor-4 polynomial-time approximation algorithm for the problem, and show that several close variants of the problem are intractable.
Intelligent relaying to reduce power consumption in mobile telephony
Authors: Narasimha Raghavan, Fasil Latheef, R. Dhivya
Venue: Proceedings of the 7th WSEAS International Conference on Electronics, Hardware, Wireless and Optical Communications (2008)

The main goal of the project is to minimize the power consumption. Power efficiency is necessary to lengthen the battery lifetime in the portable systems, as well as to reduce the operational costs and the environmental impact of stationary systems. This paper examines a new technique to enable power savings at the MT. The key idea is to split the connection between the MT and BS at an appropriate intermediary (another MT). Therefore, on the reverse link, the MT transmits to the intermediary and the intermediary forwards the call to the BS.
Combining Equational Tree Automata over AC and ACI Theories
Authors: Joe Hendrix, Hitoshi Ohsaki
Venue: Proceedings of the 19th international conference on Rewriting Techniques and Applications (2008)

In this paper, we study combining equational tree automata in two different senses: (1) whether decidability results about equational tree automata over disjoint theories ${\mathcal{E}}_1$ and ${\mathcal{E}}_2$ imply similar decidability results in the combined theory ${\mathcal{E}}_1 \cup {\mathcal{E}}_2$; (2) checking emptiness of a language obtained from the Boolean combination of regular equational tree languages. We present a negative result for the first problem. Specifically, we show that the intersection-emptiness problem for tree automata over a theory containing at least one AC symbol, one ACI symbol, and 4 constants is undecidable despite being decidable if either the AC or ACI symbol is removed. Our result shows that decidability of intersection-emptiness is a non-modular property even for the union of disjoint theories. Our second contribution is to show a decidability result which implies the decidability of two open problems: (1) If idempotence is treated as a rule f(x,x) ¿x rather than an equation f(x,x) = x, is it decidable whether an AC tree automata accepts an idempotent normal form? (2) If ${\mathcal{E}}$ contains a single ACI symbol and arbitrary free symbols, is emptiness decidable for a Boolean combination of regular ${\mathcal{E}}$-tree languages?
A Study on the Aspects of Successful Business Intelligence System Development
Authors: Il Seok Ko, Sarvar R. Abdullaev
Venue: Proceedings of the 7th international conference on Computational Science, Part IV: ICCS 2007 (2007)

Business Intelligence (BI) Systems are today considered as a major strategic tool of many well-established companies like Lufthansa, TDC Telecom and AT T. Of course, the knowledge derived from the experience of those companies could be helpful guide in building efficient BI Systems. Thus, this study highlights the main points arisen from the worldwide practice of building successful BI Systems. The managers usually expect from BI Systems the acceleration of their decision-making process while keeping the quality of each decision, the enhancement of their product development cycle, the maximization of the profit from existing product lines and the discovery of new opportunities, the establishment of better marketing with robust CRM. However, more than 50% of BI projects fail to meet these requirements. So this study investigates the critical mistakes commonly made by BI System developers and suggests profound solutions from the best BI practices.
Online Dynamic Value System for Machine Learning
Authors: Haibo He, Janusz A. Starzyk
Venue: Proceedings of the 4th international symposium on Neural Networks: Advances in Neural Networks (2007)

A novel online dynamic value system for machine learning is proposed in this paper. The proposed system has a dual network structure: data processing network (DPN) and information evaluation network (IEN). The DPN is responsible for numerical data processing, including input space transformation and online dynamic data fitting. The IEN evaluates results provided by DPN. A dynamic three-curve fitting (TCF) scheme provides statistical bounds to the curve fitting according to data distribution. The system uses a shift register communication channel. Application of the proposed value system to the financial analysis (bank prime loan rate prediction) is used to illustrate the effectiveness of the proposed system.
Forming Virtual Traces for WCET Analysis and Reduction
Authors: Jack Whitham, Neil Audsley
Venue: Proceedings of the 2008 14th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (2008)

It is notoriously difficult to model superscalar out-of-order CPUs for the purposes of worst-case execution time (WCET) analysis, which can force the use of simpler CPUs in hard real-time systems. To address this problem, it has been suggested that traces could be used to capture the timing properties of a complex CPU operation scheduler as it runs a sequence of basic blocks. In previous work, traces have been implemented using application-specific microcode. This paper proposes restrictions to a dynamic superscalar out-of-order CPU to implement virtual traces. These have the same timing properties as the traces in previous work, but microcode is not used. Instead, CPU modifications implement the same functionality. This allows traces to be used throughout a program because space requirements are minimal. To take advantage of this, a new allocation algorithm is proposed and evaluated for virtual traces.