ppxscal/embedding_network huggingface dataset:
Problem structuring methods in military command and control
Authors: Shu-Hsien Liao
Venue: Expert Systems with Applications: An International Journal (2008)

In an authorized military hierarchy organization, the procedure of problem solving must be co-ordinated with the tasks of planning, directing, and controlling. In most combat situations, problem solving knowledge is acquired from an expert (commander) or a single group of experts (staff) in a military organization. Therefore, these multiple actors (commander and the staff), multiple perspectives (multi-expertise and knowledge types), incommensurable and/or conflicting interests (resource allocation and distribution among staff planning), important intangibles (ambiguous quantitative or qualitative apparatus), and key uncertainties (unexpected internal and external situations) are part of unstructured problem. In this article, military strategy and tactics are acquired as case knowledge, rule knowledge, and heuristic knowledge content in terms of representing combat formations and planning mechanism to support problem structuring and the solution of military command and control. By doing so, this article presents a knowledge-based system architecture, including case base, rule base, heuristic base, and learning paradigm, for the military command and control procedure with strategic guidance (commander's strategy and tactics) and tactical planning (staff plans generation) system functions in terms of implementing problem structuring methods in military command and control.
XWiki concerto: un wiki sur r&eacute;seau P2P supportant le nomadisme
Authors: Gérôme Canals, Pascal Molli, Julien Maire, Stéphane Laurière, Esther Pacitti, Mounir Tlili
Venue: Proceedings of the 4th French-speaking conference on Mobility and ubiquity computing (2008)

This paper describes the demonstration of the XWiki Concerto system. XWiki Concerto is a a P2P wiki that supports mobile users. Each XWiki server is the network is extended with a replication manager that propagates local changes to remote servers and merges concurrent changes. The demonstration is based on a scenario in which different servers are used to concurrently edit a wiki page. One of the servers is then disconnected from the network but continue to be used to edit the page. The different copies are then reconciliated when the server is re- conected.
Hamilton-Jacobi equation with non-convex Hamiltonians in three dimensional level set simulations of the wet etching of silicon
Authors: Branislav Radjenovic, Marija Radmilovic-Radjenovic
Venue: Proceedings of the 1st WSEAS International Conference on Computational Chemistry (2007)

In this paper we have shown that profile evolution during anisotropic wet etching of silicon can be described by the non-convex Hamiltonian arising in the Hamilton-Jacobi equation for the level set function. Angular dependence of the silicon etching rate is determined on the basis of the silicon crystal symmetry properties.
Towards Practical Security Monitors of UML Policies for Mobile Applications
Authors: Fabio Massacci, Katsiaryna Naliuka
Venue: Proceedings of the 2008 Third International Conference on Availability, Reliability and Security (2008)

There is increasing demand for running interacting applications in a secure and controllable way on mobile devices. Such demand is not fully supported by the Java/.NET security model based on trust domains nor by current security monitors or language-based security approaches. We propose an approach that allows security policies that are i) expressive enough to capture multiple sessions and interacting applications, ii) suitable for efficient monitoring, iii) convenient for a developer to specify them. Since getting all three at once is impossible, we advocate a logical language, 2D-LTL a bi-dimensional temporal logic fit for multiple sessions and for which efficient monitoring algorithms can be given, and a graphical language based on standard UML sequence diagrams with a tight correspondence between the two.
Power series composition and change of basis
Authors: Alin Bostan, Bruno Salvy, Éric Schost
Venue: Proceedings of the twenty-first international symposium on Symbolic and algebraic computation (2008)

Efficient algorithms are known for many operations on truncated power series (multiplication, powering, exponential, ...). Composition is a more complex task. We isolate a large class of power series for which composition can be performed efficiently. We deduce fast algorithms for converting polynomials between various bases, including Euler, Bernoulli, Fibonacci, and the orthogonal Laguerre, Hermite, Jacobi, Krawtchouk, Meixner and Meixner-Pollaczek.
WDM optical interconnects: a balanced design approach
Authors: Haitham S. Hamza, Jitender S. Deogun
Venue: IEEE/ACM Transactions on Networking (TON) (2007)

In this paper, we develop a new design approach to wavelength division multiplexing (WDM) optical interconnects with the objective of designing cost-effective and scalable interconnects. Our design philosophy strikes a balance between switching and conversion costs, and requires wavelength conversion only between two fixed and predefined wavelengths. The proposed design approach exploits the potential of the wavelength exchange optical crossbar (WOC)--a device that can switch signals simultaneously and seamlessly both in space and wavelength domains. We propose a novel crossbar switch that minimizes hardware and control complexity and use it as a building block for developing a new class of three-stage Clos-like WDM optical interconnects. The design space of the proposed interconnect is characterized and its hardware complexity is analyzed. We also show that the proposed crossbar switch and the new class of WDM interconnects admit most existing routing algorithms with simple modifications. In addition, we show that our design approach can be generalized to develop a class of k-stage N×N interconnects, 3 < k ≤ 2 log2N - 1.
Celadon: a change impact analysis tool for aspect-oriented programs
Authors: Sai Zhang, Zhongxian Gu, Yu Lin, Jianjun Zhao
Venue: Companion of the 30th international conference on Software engineering (2008)

To reduce the manual effort of assessing potential affected program parts during software evolution, we develop a tool, called Celadon, which automates the change impact analysis for AspectJ programs. Celadon is implemented in the context of the Eclipse environment and designed as a plugin. It analyzes the source code of two AspectJ software versions, and decomposes their differences into a set of atomic changes together with their dependence relationships. The analysis result is reported in terms of impacted program parts and affected tests. For each affected test, Celadon also identifies a subset of affecting changes that are responsible for the test's behavior change. In particular, as one of its applications, Celadon helps facilitate fault localization by isolating failure-inducing changes for one specific affected test from other irrelevant changes.
A psychophysical study of fixation behavior in a computer game
Authors: Veronica Sundstedt, Efstathios Stavrakis, Michael Wimmer, Erik Reinhard
Venue: Proceedings of the 5th symposium on Applied perception in graphics and visualization (2008)

Prediction of gaze behavior in gaming environments can be a tremendously useful asset to game designers, enabling them to improve gameplay, selectively increase visual fidelity, and optimize the distribution of computing resources. The use of saliency maps is currently being advocated as the method of choice for predicting visual attention, crucially under the assumption that no specific task is present. This is achieved by analyzing images for low-level features such as motion, contrast, luminance, etc. However, the majority of computer games are designed to be easily understood and pose a task readily apparent to most players. Our psychophysical experiment shows that in a task-oriented context such as gaming, the predictive power of saliency maps at design time can be weak. Thus, we argue that a more involved protocol utilizing eye tracking, as part of the computer game design cycle, can be sufficiently robust to succeed in predicting fixation behavior of players.
Opportunistic and cooperative spatial multiplexing in MIMO ad hoc networks
Authors: Shan Chu, Xin Wang
Venue: Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing (2008)

It is important and challenging to develop efficient schemes to coordinate node transmissions in a MIMO-based ad hoc network. In this work, we propose a scheme to fully exploit the multiuser diversity and spatial diversity by taking advantage of the meshed topology, while also supporting user transmission quality requirement. We formulate a concrete physical model, and present cross-layer algorithms which take advantage of physical layer channel information to opportunistically schedule cooperative spatial multiplexed transmissions between nodes, so that the data rate of the network can be maximized. The performance of our algorithm is studied by extensive simulations and the results demonstrate that our algorithm is very effective and can significantly increase the throughput while reducing the transmission delay.
Towards Scalable Deployment of Sensors and Actuators for Industrial Applications
Authors: Han Chen, Paul Chou, Hao Yang
Venue: Proceedings of the 2008 IEEE International Conference on Sensor Networks, Ubiquitous, and Trustworthy Computing (sutc 2008) (2008)

While electronic sensors and actuators have a long history of being used for a broad variety of industrial applications, these applications tend to be self-contained, for example, to control a process or to automate an operation. The recent technology advancements in ubiquitous connectivity and distributed computing have afforded improved business performance or novel business models by narrowing the gap between the real-world conditions and the state of business information systems with sensors and actuators seamlessly integrated in critical business processes. This paper first describes three industry examples to motivate and discuss the key challenges for the ubiquitous applications of sensors and actuators. In particular, it argues for the need of an architecture that promotes component assembly for deployment scalability and supports application-specific QoS requirements such as timeliness, reliability and security. The paper also describes a prototype solution to illustrate our approach and progress.
Avoiding Energy Holes in Wireless Sensor Networks with Nonuniform Node Distribution
Authors: Xiaobing Wu, Guihai Chen, Sajal K. Das
Venue: IEEE Transactions on Parallel and Distributed Systems (2008)

In this paper, we investigate the theoretical aspects of the nonuniform node distribution strategy used to mitigate the energy hole problem in wireless sensor networks (WSNs). We conclude that in a circular multihop sensor network (modeled as concentric coronas) with nonuniform node distribution and constant data reporting, the unbalanced energy depletion among all the nodes in the network is unavoidable. Even if the nodes in the inner coronas of the network have used up their energy simultaneously, the ones in the outmost corona may still have unused energy. This is due to the intrinsic many-to-one data traffic pattern of WSNs. Nevertheless, near balanced energy depletion in the network is possible only if the number of nodes increases in geometric progression from the outer coronas to the inner ones except the outmost one. Based on the analysis, we propose a novel nonuniform node distribution strategy to achieve the near balanced energy depletion in the network. We regulate the number of nodes in each corona and derive the ratio between the node densities in the adjacent (i+1)-th and i-th coronas by the strategy. Finally, we propose q-Switch Routing, a distributed shortest path routing algorithm tailored for the proposed nonuniform node distribution strategy. Extensive simulations have been performed to validate the analysis.
Alternative adaptive fuzzy C-means clustering
Authors: Somchai Champathong, Sartra Wongthanavasu, Khamron Sunat
Venue: Proceedings of the 7th WSEAS International Conference on Evolutionary Computing (2006)

-Fuzzy C-Means (FCM) clustering algorithm is used in a variety of application domains. Fundamentally, it cannot be used for the subsequent data (adaptive data). A complete dataset has to be static prior to implementing the algorithm. This paper presents an alternative adaptive FCM which is able to cope with this limitation. The adaptive FCM using Euclidean and Mahalanobis distances were compared to alternative adaptive FCM for performance evaluation purposes. Two different datasets were taken into consideration for the compared test. In this respect, adaptive FCM using Euclidean and Mahalanobis distances results in more misclassified data. By implementing synthesis dataset with outlier, adaptive FCM using Euclidean and Mahalanobis distances give 9% and 14% of misclassification, respectively. While implemented in alternative adaptive FCM the proposed method exhibits the promising performance by giving 2% of misclassification. This result shows similar manner for carrying out in iris dataset.
Discovering key concepts in verbose queries
Authors: Michael Bendersky, W. Bruce Croft
Venue: Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval (2008)

Current search engines do not, in general, perform well with longer, more verbose queries. One of the main issues in processing these queries is identifying the key concepts that will have the most impact on effectiveness. In this paper, we develop and evaluate a technique that uses query-dependent, corpus-dependent, and corpus-independent features for automatic extraction of key concepts from verbose queries. We show that our method achieves higher accuracy in the identification of key concepts than standard weighting methods such as inverse document frequency. Finally, we propose a probabilistic model for integrating the weighted key concepts identified by our method into a query, and demonstrate that this integration significantly improves retrieval effectiveness for a large set of natural language description queries derived from TREC topics on several newswire and web collections.
Feature driven browsing
Authors: David Röthlisberger, Orla Greevy, Oscar Nierstrasz
Venue: Proceedings of the 2007 international conference on Dynamic languages: in conjunction with the 15th International Smalltalk Joint Conference 2007 (2007)

Development environments typically present the software engineer with a structural perspective of an object-oriented system in terms of packages, classes and methods. From a structural perspective it is difficult to gain an understanding of how source entities participate in a system's features at runtime, especially when using dynamic languages such as Smalltalk. In this paper we evaluate the usefulness of offering an alternative, complementary feature-centric perspective of a software system when performing maintenance activities. We present a feature-centric environment combining interactive visual representations of features with a source code browser displaying only the classes and methods participating in a feature under investigation. To validate the usefulness of our feature-centric view, we conducted a controlled empirical experiment where we measured and compared the performance of subjects when correcting two defects in an unfamiliar software system with a traditional development environment and with our feature-centric environment. We evaluate both quantitative and qualitative data to draw conclusions about the usefulness of a feature-centric perspective to support program comprehension during maintenance activities.
Fault-free Hamiltonian cycles in locally twisted cubes under conditional edge faults
Authors: Sun-Yuan Hsieh, Chang-Yu Wu, Chia-Wei Lee
Venue: Proceedings of the 13th International Conference on Parallel and Distributed Systems - Volume 01 (2007)

The locally twisted cube is a variation of hypercube, which possesses some properties superior to the hypercube. In this paper, we investigate the edge-fault-tolerant hamiltoncity of an n-dimensional locally twisted cube, denoted by LTQn. We show that for any LTQn (n &#x2265; 3) with at most 2n &#x2212; 5 faulty edges in which each node is incident to at least two fault-free edges, there exists a fault-free Hamiltonian cycle. We also demonstrate that our result is optimal with respect to the number of faulty edges tolerated.
Introducing the Advanced Technology Executive Forum
Authors: Rangachar Kasturi, Carl K. Chang
Venue: Computer (2008)

The IEEE Computer Society will launch the Advanced Technology Executive Forum, an executive circle of high-profile and committed leaders from the computing industry, when the founding members hold their inaugural meeting in May 2008.
DALICA: Agent-Based Ambient Intelligence for Cultural-Heritage Scenarios
Authors: Stefania Costantini, Leonardo Mostarda, Arianna Tocchio, Panagiota Tsintza
Venue: IEEE Intelligent Systems (2008)

Agent technology can support ambient-intelligence scenarios that help users experience cultural assets or monitor the transportation of cultural assets. In one scenario, users visit Villa Adriana, an archaeological site in Tivoli, Italy. The agents discover users' movements via a Galileo satellite signal. The agents, developed in the DALI programming language, proactively learn and enhance user profiles to competently assist users during their visits. The agents elicit users' habits and preferences and propose cultural assets according to the learned profile. In another scenario, agents monitor the security of artwork being transported from a museum in Rome to one in Villa Adriana.
Issues and Models of Security Oriented Systems
Authors: C. V. ramamoorthy
Venue: Proceedings of the Seventh IEEE/ACIS International Conference on Computer and Information Science (icis 2008) (2008)

Virus infestation is rampant in today’s internet based IT activities. The viruses (including worms, and Trojan Horses) are constantly and rapidly created to damage e=commerce and web based application. Importantly, they corrupt communications, valuable databases and disrupt service oriented functions. In the future, they can severely hurt the new applications spanning from health care to home appliance control. We shall present a broad discussion on a few mostlysoftware engineering topics, pointing out their relevance and relationship to IT security issues.
A distributed, simultaneously multi-threaded (SMT) processor with clustered scheduling windows for scalable DSP performance
Authors: Mladen Berekovic, Tim Niggemeier
Venue: Journal of Signal Processing Systems (2008)

A scalable, distributed, processor architecture is presented that emphasizes on high performance computing for digital signal processing applications by combining high frequency design techniques with a very high degree of parallel processing on a chip. The architecture is based on a superscalar processor model with a modified Tomasulo scheme that was extended to eliminate all central control structures for the data flow and to support simultaneous instruction issue from multiple independent threads [simultaneously multi-threaded (SMT)]. Consequent application of fine clustering reduces the cycle-time for wire-sensitive building blocks of the processor like the register file and the scheduling window and leads to a distributed architecture model, where independent thread processing units, arithmetic logic units, registers files and memories are distributed across the chip and communicate with each other by special network. A special communication protocol replaces broadcasting and associative compare of destination tags in a centralised instruction scheduler with explicit operand transfer instructions, thus decentralizing the control of the data flow to the greatest extent. As a result, the processor cycle time does neither depend on the issue bandwidth of a single thread nor on the execution bandwidth of the SMT processor. This makes the performance of the architecture scalable with both the number of function and the number of thread units without having any impact on the processors cycle-time. Performance and scalability of the proposed microarchitecture is demonstrated with critical signal processing kernels from the MPEG-4 video coding standard on a cycle-true simulator.
Brief Communication: MASIC: A software program for fast quantitation and flexible visualization of chromatographic profiles from detected LC-MS(/MS) features
Authors: Matthew E. Monroe, Jason L. Shaw, Don S. Daly, Joshua N. Adkins, Richard D. Smith
Venue: Computational Biology and Chemistry (2008)

Quantitative analysis of liquid chromatography (LC)-mass spectrometry (MS) and tandem mass spectrometry (MS/MS) data is essential to many proteomics studies. We have developed MASIC to accurately measure peptide abundances and LC elution times in LC-MS/MS analyses. This software program uses an efficient processing algorithm to quickly generate mass specific selected ion chromatograms from a dataset and provides an interactive browser that allows users to examine individual chromatograms with a variety of options.
Various Constructions of Continuous Information Systems
Authors: Luoshan Xu, Xuxin Mao
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2008)

In this paper, some classical constructions for continuous information systems in a more general sense are established. Some non-classical constructions for continuous information systems such as weak systems, algebraic kernels and algebraic retracts are also introduced.
Detecting multiple mean breaks at unknown points in official time series
Authors: Carmela Cappelli, Richard N. Penny, William S. Rea, Marco Reale
Venue: Mathematics and Computers in Simulation (2008)

In this paper, we propose a computationally effective approach to detect multiple structural breaks in the mean occurring at unknown dates. We present a non-parametric approach that exploits, in the framework of least squares regression trees, the contiguity property of data generating processes in time series data. The proposed approach is applied first to simulated data and then to the Quarterly Gross Domestic Product in New Zealand to assess some of anomalous observations indicated by the seasonal adjustment procedure implemented in X12-ARIMA are actually structural breaks.
An evaluation study of a digital library of ideas: Workflow Model and classroom use
Authors: Hilary Grierson, Andrew Wodehouse, Caroline Breslin, William Ion, David Nicol, Neal Juster
Venue: International Journal on Digital Libraries (2008)

The Department of Design Manufacturing and Engineering Management at the University of Strathclyde, Glasgow, UK, has been developing a digital library to support design engineering student learning through the Digital Libraries for Global Distributed Innovative Design Education and Teamwork project (http://www.didet.ac.uk, December, 2007). Previous related studies have observed and analysed how students search for, store, structure and share design engineering information (Grierson et al. in paper presented at the Network Learning Conference, pp. 572&#x2013;579, 2004; Nicol et al. in Open Learning 20(1):31&#x2013;49, 2005) and these studies have identified the need for the design and development of a digital library with two system components, which best suit the design process: (i) an informal shared workspace; the &#x2018;LauLima&#x2019; Learning Environment and (ii) a repository of more formal searchable and browsable design information; the &#x2018;LauLima&#x2019; Digital Library (McGill et al. in Br. J. Educ. Technol. 36(4):629&#x2013;642, 2005). This paper focuses on the Workflow Model developed to populate the digital library and presents findings from early use of the digital library by students and staff.