ppxscal/embedding_network huggingface dataset:
Implication of network size and structure on organizations' knowledge transfer
Authors: Fangcheng Tang, Jifeng Mu, Douglas L. MacLachlan
Venue: Expert Systems with Applications: An International Journal (2008)

Past studies have suggested an interaction between knowledge transfer, structural characteristics and behavioral patterns of network organizations. However, most research has explored the process of knowledge transfer from the micro-level perspective, and less attention has been paid to the macro-level dynamic behavior patterns of network-based organization and the micro-macro links in the process of knowledge transfer. In this paper, a virtual experiment (VE) is utilized to explore the interdependence of knowledge transfer and dynamic behavior patterns of network-based organizations on the basis of rules systems. Our model shows that the speed of knowledge transfer and power influence of individuals play dominant roles in the process of knowledge transfer. The larger the network organization and the greater number of the neighbor nodes an organization have, the higher the proportion of nodes that will change their knowledge state.
Accommodating EIS UML 2.0 Profile using a standard UML modeling tool
Authors: M. Nikolaidou, N. Alexopoulou, A. Tsadimas, A. Dais, D. Anagnostopoulos
Venue: Proceedings of the International Conference on Software Engineering Advances (2007)

Extension mechanisms offered by UML 2.0 are often explored in order to define UML profiles that serve specific modeling purposes. These UML 2.0 profiles should be effectively accommodated by standard UML-based modeling tools, which provide the means for applying them in practice. Almost every UML 2.0 modeling tool supports the definition of stereotypes and the description of constraints in Object Constraint Language. However, implementing a profile in practice often entails the development of additional functionality. This requirement mainly stems from the fact that when dealing with complex models it is more efficient for end-users to help them enforce a constraint rather than notify them when it is broken. Such issues, encountered when developing a UML 2.0 profile for enterprise information systems engineering using Rational Software Modeler as a standard UML 2.0 modeling tool, are discussed in the paper.
Multi-radio medium access control protocol for wireless sensor networks
Authors: Junaid Ansari, Xi Zhang, Petri Mähönen
Venue: Proceedings of the 5th international conference on Embedded networked sensor systems (2007)

In this demonstration paper, we present a multi-radio MAC protocol and a prototype sensor node platform which supports dual frequency bands of operation. The multi-radio MAC protocol combines the advantages of both high and low frequency bands to give an energy efficient performance with high throughput and low latency in several applications. Our prototype supports spectrum agility, which is becoming important due to ever crowding spectrum. Besides demonstrating the improved performance metrics and spectrum agility support, we will also present the flexibility provided by our MAC protocol.
Pretty Pane Tiling of Pretty Windows
Authors: J. Gait
Venue: IEEE Software (1986)

Certain graphic windows on VDT screens called pretty windows are more aesthetically pleasing than arbitrary rectangles. The user interface described here enforces this aesthetic. 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
3D-simulation of topology-induced changes of effective permeability and permittivity in composite materials
Authors: B. Hallouet, R. Pelster
Venue: Journal of Nanomaterials (2007)

We have performed 3D simulations of complex effective permittivity and permeability for random binary mixtures of cubic particles below the percolation threshold. We compare two topological classes that correspond to different spatial particle arrangements: cermet topology and aggregate topology. At a low filling factor of f=10%, where most particles are surrounded by matrix material, the respective effective material parameters are indistinguishable. At higher concentrations, a systematic difference emerges: cermet topology is characterized by lower effective permittivity and permeability values. A distinction between topological classes might thus be a useful concept for the analysis of real systems, especially in cases where no exact effective-medium model is available.
Two takes on the social brain: A comparison of theory of mind tasks
Authors: Maria Ida Gobbini, Aaron C. Koralek, Ronald E. Bryan, Kimberly J. Montgomery, James V. Haxby
Venue: Journal of Cognitive Neuroscience (2007)

We compared two tasks that are widely used in research on mentalizing---false belief stories and animations of rigid geometric shapes that depict social interactions---to investigate whether the neural systems that mediate the representation of others' mental states are consistent across these tasks. Whereas false belief stories activated primarily the anterior paracingulate cortex (APC), the posterior cingulate cortex/precuneus (PCC/PC), and the temporo-parietal junction (TPJ)---components of the distributed neural system for theory of mind (ToM)---the social animations activated an extensive region along nearly the full extent of the superior temporal sulcus, including a locus in the posterior superior temporal sulcus (pSTS), as well as the frontal operculum and inferior parietal lobule (IPL)---components of the distributed neural system for action understanding---and the fusiform gyrus. These results suggest that the representation of covert mental states that may predict behavior and the representation of intentions that are implied by perceived actions involve distinct neural systems. These results show that the TPJ and the pSTS play dissociable roles in mentalizing and are parts of different distributed neural systems. Because the social animations do not depict articulated body movements, these results also highlight that the perception of the kinematics of actions is not necessary to activate the mirror neuron system, suggesting that this system plays a general role in the representation of intentions and goals of actions. Furthermore, these results suggest that the fusiform gyrus plays a general role in the representation of visual stimuli that signify agency, independent of visual form.
A Method for Improving the Stability of Feature Selection Algorithm
Authors: Li Zhang
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 01 (2007)

This paper researches on problems of improving the stability of feature selection algorithm. A Bagging-based selective results ensemble method is proposed. First use a feature selection algorithm and different training subsets to select several feature subsets. Then compute weights of each selected feature subset by mutual information and classifying accuracy. At last use a Bagging-based method to assemble the selective subsets. Experiments in intrusion detection data of KDD cup'99 show that this algorithm could obtain better results.
A hybrid approach to supplier selection for the maintenance of a competitive supply chain
Authors: Sung Ho Ha, Ramayya Krishnan
Venue: Expert Systems with Applications: An International Journal (2008)

This article outlines a hybrid method, incorporating multiple techniques into an evaluation process, in order to select competitive suppliers in a supply chain. It enables a purchaser to do single sourcing and multiple sourcing by calculating a combined supplier score (CSS), which accounts for both qualitative and quantitative factors that impact on supply chain performance. By performing a cluster analysis, it draws a supplier map (SM) so as to position suppliers within the qualitative and quantitative dimensions of performance efficiency, and to select a portfolio of suppliers from supplier segments, which are different in performance with regard to key factors.
Cluster Label-based ZigBee Routing Protocol with High Scalability
Authors: Kwang Koog Lee, Seong Hoon Kim, Hong Seong Park
Venue: Proceedings of the Second International Conference on Systems and Networks Communications (2007)

Since the ZigBee mesh routing algorithm is similar to AODV based on flooding, the networks suffer from the scalability problem as the number of nodes or the data traffic increases. Thus, for low-rate ZigBee mesh networks it is necessary to design an effective routing protocol to take the scalability into account. In this paper, we propose a ZigBee mesh routing protocol based on Cluster Label (ZiCL). As ZiCL hierarchically divides a ZigBee-enabled network into one or more logical clusters, when a node starts route discovery procedure, it encourages nodes with the same Cluster Label to share the routing information. This results in fewer route discoveries, and hence effectively relieves the number of potential control traffic required to establish a shortest path between nodes. Simulation results show that ZiCL helps to reduce routing overhead and improve performance of ZigBee mesh networks.
Towards Termination Criteria of Ant Colony Optimization
Authors: Qiang Lv, Xiaoyan Xia
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 05 (2007)

Ant colony optimization (ACO for short) has been proved a successful meta-heuristic by a huge of empirical studies. This paper discusses the termination criteria of ACO and therefore provides research ideas to other meta-heuristics. A general discussion about four types of termination crite- ria has been firstly discussed in this article. Then some measures of convergence based on pheromone have been introduced. And a new termination criterion based on Bayesian approach is presented. Finally a new convergence proof for a class of ACO algorithms is presented.
Inferring Gene Regulatory Networks using Differential Evolution with Local Search Heuristics
Authors: Nasimul Noman, Hitoshi Iba
Venue: IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB) (2007)

We present a memetic algorithm for evolving the structure of biomolecular interactions and inferring the effective kinetic parameters from the time series data of gene expression using the decoupled Ssystem formalism. We propose an Information Criteria based fitness evaluation for gene network model selection instead of the conventional Mean Squared Error (MSE) based fitness evaluation. A hill-climbing local-search method has been incorporated in our evolutionary algorithm for efficiently attaining the skeletal architecture which is most frequently observed in biological networks. The suitability of the method is tested in gene circuit reconstruction experiments, varying the network dimension and/or characteristics, the amount of gene expression data used for inference and the noise level present in expression profiles. The reconstruction method inferred the network topology and the regulatory parameters with high accuracy. Nevertheless, the performance is limited to the amount of expression data used and the noise level present in the data. The proposed fitness function has been found more suitable for identifying correct network topology and for estimating the accurate parameter values compared to the existing ones. Finally, we applied the methodology for analyzing the cell-cycle gene expression data of budding yeast and reconstructed the network of some key regulators.
Dynamic key management for secure routing in MANET: Research Articles
Authors: Wuxu Peng, Yalin Wang, E. K. Park, Kia Makki
Venue: Wireless Communications Mobile Computing (2007)

A secure key management scheme for the locality caching multi-root multi-generation (LCMRMG) MANET routing algorithm is proposed. The scheme takes advantage of the multi-root nature of LCMRMG and successfully integrates public key, certification and threshold technologies. The scheme is hierarchical and fully distributed. The key management operations are flexible in secure share distribution and scalable well to large MANET. Extensive simulations have shown that the scheme is secure, robust, efficient, and scalable. Copyright &copy; 2007 John Wiley & Sons, Ltd.
The costs of emotional attention: Affective processing inhibits subsequent lexico-semantic analysis
Authors: Niklas Ihssen, Sabine Heim, Andreas Keil
Venue: Journal of Cognitive Neuroscience (2007)

The human brain has evolved to process motivationally relevant information in an optimized manner. The perceptual benefit for emotionally arousing material, termed motivated attention, is indexed by electrocortical amplification at various levels of stimulus analysis. An outstanding issue, particularly on a neuronal level, refers to whether and how perceptual enhancement for arousing signals translates into modified processing of information presented in temporal or spatial proximity to the affective cue. The present studies aimed to examine facilitation and interference effects of task-irrelevant emotional pictures on subsequent word identification. In the context of forced-choice lexical decision tasks, pictures varying in hedonic valence and emotional arousal preceded word/ pseudoword targets. Across measures and experiments, high-arousing compared to low-arousing pictures were associated with impaired processing of word targets. Arousing pleasant and unpleasant pictures prolonged word reaction times irrespective of stimulus-onset asynchrony (80 msec, 200 msec, 440 msec) and salient semantic category differences (e.g., erotica vs. mutilation pictures). On a neuronal level, interference was reflected in reduced N1 responses (204--264 msec) to both target types. Paralleling behavioral effects, suppression of the late positivity (404--704 msec) was more pronounced for word compared to pseudoword targets. Regional source modeling indicated that early reduction effects originated from inhibited cortical activity in posterior areas of the left inferior temporal cortex associated with orthographic processing. Modeling of later reduction effects argues for interference in distributed semantic networks comprising left anterior temporal and parietal sources. Thus, affective processing interferes with subsequent lexico-semantic analysis along the ventral stream.
Semantic Representation and Ontology Construction in the Question Answering System
Authors: Ying-Hong Wang, Wen-Nan Wang, Chu-Chi Huang, Ting-Wei Chang, Yi-Hsiang Yen
Venue: Proceedings of the 7th IEEE International Conference on Computer and Information Technology (2007)

To build an automatic assistance for learning and provide a self-paced learning mechanism are the objectives in the e-learning environment. The paper improves the previous proposed Semantic Question Answering System which applies Link Grammar and WordNet to form a Semantic Tree to represent the meaning of question and further find the relevant answer based on the selected Data Structure Ontology. The paper addresses the improved functions including the flexible answering method which can refine the Semantic Tree to find more relevant answers, the Ontology Extension Module is designed to acquire data from Internet to raise the ontology and the Feedback for System module is designed for the instructors to provide more sufficient knowledge.
Sub-Symbolic Semantic Layer in Cyc for Intuitive Chat-Bots
Authors: G. Pilato, A. Augello, G. Vassallo, S. Gaglio
Venue: Proceedings of the International Conference on Semantic Computing (2007)

The work presented in this paper aims to combine Latent Semantic Analysis methodology, common sense and traditional knowledge representation in order to improve the dialogue capabilities of a conversational agent. In our approach the agent brain is characterized by two areas: a "rational area", composed by a structured, rule-based knowledge base, and an "associative area", obtained through a data-driven semantic space. Concepts are mapped in this space and their mutual geometric distance is related to their conceptual similarity. The geometric distance between concepts implicitly defines a sub-symbolic relationship net, which can be seen as a new "subsymbolic semantic layer" automatically added to the Cyc ontology. Users queries can also be mapped in the same conceptual space, and evoke similar ontology concepts. As a result the agent can exploit this feature, attempting to retrieve ontological concepts that are not easily reachable by means of the traditional ontology reasoning engine.
Helping Teachers Automate Student Sketch Assessment
Authors: Sandra B. Fan
Venue: Proceedings of the IEEE Symposium on Visual Languages and Human-Centric Computing (2007)

In this work, we propose a system to enable teachers to more easily automate the assessment of online, student-drawn diagrams. Similar to programming-by-demonstration, teachers specify the correct solutions by drawing their own "solution" diagrams, which the automated assessment system then uses to compare against students' diagrams to see if their diagrams match the solutions.
A Comparison of the Axiomatic and Functional Models of Structured Programming
Authors: V. R. Basili
Venue: IEEE Transactions on Software Engineering (1980)

This paper discusses axiomatic and functional models of the semantics of structured programming. The models are presented together with their respective methodologies for proving program correctness and for deriving correct programs. Examples using these methodologies are given. Finally, the models are compared and contrasted.
Using a Microprocessor in a Walsh-Fourier Spectral Analyzer
Authors: R. Kitai
Venue: Computer (1976)

The spectrum of a frequency-limited periodic wave may be obtained rapidly by measuring its truncated Walsh spectrum, and then converting from Walsh spectrum to Fourier spectrum after the measurement. The conversion process consists of a matrix multiplication in which a measured Walsh spectrum vector, of dimension 2k, is multiplied by a 2kX 2kconversion matrix that is compensated for Walsh-spectrum truncation, to yield the corresponding Fourier spectrum vector. The microprocessor is well suited to this end; it is also useful in monitoring instrument panel switches and driving a display and print-out. This paper compares available microprocessors from the viewpoint of BCD processing and concludes that the Fairchild PPS25 processor is the one best suited to meet the requirements.
Power Attacks Resistance of Cryptographic S-boxes with added Error Detection Circuits
Authors: Francesco Regazzoni, Thomas Eisenbarth, Johann Grobschadl, Luca Breveglieri, Paolo Ienne, Israel Koren, Christof Paar
Venue: Proceedings of the 22nd IEEE International Symposium on Defect and Fault-Tolerance in VLSI Systems (2007)

Many side-channel attacks on implementations of cryptographic algorithms have been developed in recent years demonstrating the ease of extracting the secret key. In response, various schemes to protect cryptographic devices against such attacks have been devised and some implemented in practice. Almost all of these protection schemes target an individual side-channel attack and consequently, it is not obvious whether a scheme for protecting the device against one type of sidechannel attacks may make the device more vulnerable to another type of side-channel attacks. We examine in this paper the possibility of such a negative impact for the case where fault detection circuitry is added to a device (to protect it against fault injection attacks) and analyze the resistance of the modified device to power attacks. To simplify the analysis we focus on only one component in the cryptographic device (namely, the S-box in the AES and Kasumi ciphers), and perform power attacks on the original implementation and on a modified implementation with an added parity check circuit. Our results show that the presence of the parity check circuitry has a negative impact on the resistance of the device to power analysis attacks.
From tree patterns to generalized tree patterns: on efficient evaluation of XQuery
Authors: Zhimin Chen, H. V. Jagadish, Laks V. S. Lakshmanan, Stelios Paparizos
Venue: Proceedings of the 29th international conference on Very large data bases - Volume 29 (2003)

XQuery is the de facto standard XML query language, and it is important to have efficient query evaluation techniques available for it. A core operation in the evaluation of XQuery is the finding of matches for specified tree patterns, and there has been much work towards algorithms for finding such matches efficiently. Multiple XPath expressions can be evaluated by computing one or more tree pattern matches. However, relatively little has been done on efficient evaluation of XQuery queries as a whole. In this paper, we argue that there is much more to XQuery evaluation than a tree pattern match. We propose a structure called generalized tree pattern (GTP) for concise representation of a whole XQuery expression. Evaluating the query reduces to finding matches for its GTP. Using this idea we develop efficient evaluation plans for XQuery expressions, possibly involving join, quantifiers, grouping, aggregation, and nesting. XML data often conforms to a schema. We show that using relevant constraints from the schema, one can optimize queries significantly, and give algorithms for automatically inferring GTP simplifications given a schema. Finally, we show, through a detailed set of experiments using the TIMBER XML database system, that plans via GTPs (with or without schema knowledge) significantly outperform plans based on navigation and straightforward plans obtained directly from the query.
A New Dynamic Multi-objective Optimization Evolutionary Algorithm
Authors: Bojin Zheng
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 05 (2007)

Dynamic Multi-objective Optimization Problems are very common in real-world applications. The researches on applying Evolutionary Algorithm into such problems are attracting more and more researchers. In this paper, a new Dynamic Multi-objective Optimization Evolutionary Algorithm which utilizes hyper-mutation operator to deal with dynamics and Geometrical Pareto Selection to deal with multi-objective is introduced. The experimental results show that the performance is satisfactory.
Mobile gaming
Authors: Jason O. B. Soh, Bernard C. Y. Tan
Venue: Communications of the ACM (2008)

Tens of millions of users worldwide play games, as well as make phone calls, on their cell phones and other handheld devices.
Achieving Managerial Goals in Business Process Components Design Using Genetic Algorithms
Authors: Wararat Rungworawut, Twittie Senivongse, Karl Cox
Venue: Proceedings of the 5th ACIS International Conference on Software Engineering Research, Management & Applications (2007)

Business process modelling is a tool for requirements engineers or business analysts to express business requirements in terms of what activities are to take place when the application software executes. Since business process models can be shared by different organisations or business domains, we can apply the concept of software component fabrication to the fabrication of process components. A business process model will be partitioned into subprocesses, each of which is a process component that may be used as part of other business process models. This paper proposes an approach to designing process components by using a genetic algorithm. Based on a fitness function, the approach can give a recommendation for a process components design that optimally achieves managerial goals, i.e. cost effectiveness, ease of assembly, customisation, reusability, and maintainability. We present our approach via an example of a flight reservation system.