ppxscal/embedding_network huggingface dataset:
You are going to teach simulation: now what? tips and strategies
Authors: Michael Freimer, Lee W. Schruben, Theresa M. Roeder, Charles R. Standridge, Catherine M. Harmonosky, Ingolf Ståhl
Venue: Proceedings of the 36th conference on Winter simulation (2004)

Facing the prospect of teaching a simulation course for the first time can be a bit overwhelming. This panel shares tips and strategies for teaching simulation based upon a wide variety of experiences, from academic newcomer to many years in the field, and having a variety of student audiences. We hope everyone will come away with a new idea, with our particular focus of helping new academics consider different simulation teaching approaches.
Efficient m-Ary Balanced Codes which Are Invariant under Symbol Permutation
Authors: Raffaele Mascella, Luca G. Tallini
Venue: IEEE Transactions on Computers (2006)

A symbol permutation invariant balanced (SPI-balanced) code over the alphabet {\hbox{\rlap{Z}\kern 2.0pt{\hbox{Z}}}}_m=\{0,1,\ldots,m-1\} is a block code over {\hbox{\rlap{Z}\kern 2.0pt{\hbox{Z}}}}_m such that each alphabet symbol occurs as many times as any other symbol in every codeword. For this reason, every permutation among the symbols of the alphabet changes an SPI-balanced code into an SPI-balanced code. This means that SPI--balanced words are "the most balanced” among all possible m{\hbox{-}}\rm ary balanced word types and this property makes them very attractive from the application perspective. In particular, they can be used to achieve m{\hbox{-}}\rm ary DC-free communication, to detect/correct asymmetric/unidirectional errors on the m{\hbox{-}}\rm ary asymmetric/unidirectional channel, to achieve delay-insensitive communication, to maintain data integrity in digital optical disks, and so on. This paper gives some efficient methods to convert (encode) m{\hbox{-}}\rm ary information sequences into m{\hbox{-}}\rm ary SPI-balanced codes whose redundancy is equal to roughly double the minimum possible redundancy r_{min}. It is proven that r_{min} \simeq [(m-1)/2]\log_{m}n-(1/2)[1-(1/\log_{2\pi}m)]m-(1/\log_{2\pi}m) for any code which converts k information digits into an SPI-balanced code of length n=k+r. For example, the first method given in the paper encodes k information digits into an SPI-balanced code of length n=k+r, with r=(m-1)\log_{m}k+O(m\log_{m}\log_{m}k). A second method is a recursive method, which uses the first as base code and encodes k digits into an SPI-balanced code of length n=k+r, with r\simeq(m-1)\log_{m}n-\log_{m}[(m-1)!].
Nonnegative matrices in digital signal processing
Authors: Luca Benvenuti, Lorenzo Farina
Venue: Signal Processing (2006)

The area of signal processing is very wide. In this review paper we will focus on how the theory of nonnegative matrices may arise in the field of digital filter design: an area in which the role of nonnegative matrices is increasingly relevant due to the development of new technologies in the field of optical components and charge coupling devices.
A new kind of adaptive frequency shift filter
Authors: J. Zhang, K. M. Wong, Q. Jin, Q. Wu
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1995. on International Conference - Volume 02 (1995)

In this paper, two types of adaptive FREquency SHift filters are proposed. One is LMS adaptive FRESH filter. The other is blind adaptive FRESH filter. By exploiting the spectral correlation of cyclostationary signals, these adaptive filters can separate the signals which overlap in both frequency and time domain. Theoretical development and simulations of these filters are given in this paper. The results show that for signals which spectrally overlap, the adaptive FRESH filters can perform very well while ordinary adaptive filters fail.
P2P-Join: A Keyword Based Join Operation in Relational Database Enabled Peer-to-Peer Systems
Authors: Zhigang Chen, Zhongding Huang, Bo Ling, Jiang Li
Venue: Proceedings of the 17th International Conference on Database and Expert Systems Applications (2006)

Query-by-keywords is the most popular manner to search for data in this computing age. However, most work was proposed for searching centralized relational databases. This paper investigates how keyword search to be deployed in Relational database-enabled peer-to-peer systems. Unlike centralized system, the key challenges in this new computing paradigm come from the autonomy of peers, the lack of a global schema, and the dynamics of the peer connectivity. First, the concept of P2P-Join is proposed, which is a join operation to combine tuples among relations from different peers containing certain keywords in the query. Second, a fully distributed framework to realize P2P-Join processing is devised, which not only inherits the syntax and semantics of traditional join but also cherishes the ideology of peer-to-peer computing. Finally, two mechanisms are proposed to improve the performance of the operation: a join path selecting order scheme and a pushbased load balancing mechanism across peers.
Analyzing Feature Significance from Various Systems for Mass Diagnosis
Authors: Ping Zhang, Kuldeep Kumar
Venue: Proceedings of the International Conference on Computational Inteligence for Modelling Control and Automation and International Conference on Intelligent Agents Web Technologies and International Commerce (2006)

This paper compares a few classification models for mass classification and analyzes the feature significance for mass classification using various models. It involves a few algorithms for feature selection and also analyzes the individual feature significance. The comparison of classification models is based on the same datasets for mass diagnosis.
Identifying Indirect Attribute Correspondences in Multilingual Schemas
Authors: Hongding Wang, Shaohua Tan, Shiwei Tang, Dongqing Yang, Yunhai Tong
Venue: Proceedings of the 17th International Conference on Database and Expert Systems Applications (2006)

A fundamental problem in schema integration is attribute correspondences identification. This paper studies a problem of identifying indirect attribute correspondences in multilingual schemas. As far as we know, previous researches of schema integration mainly attempted to solve schema matching in monolingual schemas, neglecting schema matching in multilingual schemas. In this paper, through analyzing two schemas of a large financial corporate of China, we discover relationship of the attributes between the given multilingual schemas. And with domain ontology, indirect attribute correspondences are identified in multilingual schemas. The method extends the abilities of our previous work, and can deals with directional as well as indirect attribute correspondence identification in multilingual schemas. Moreover, a computer-aided system to deal with the problem with the method is provided, which shows its effectiveness in practice.
A Mathematical Approach in the Design of Arterial Bypass Using Unsteady Stokes Equations
Authors: Valery Agoshkov, Alfio Quarteroni, Gianluigi Rozza
Venue: Journal of Scientific Computing (2006)

In this paper we present an approach for the study of Aorto-Coronaric bypass anastomoses configurations using unsteady Stokes equations. The theory of optimal control based on adjoint formulation is applied in order to optimize the shape of the zone of the incoming branch of the bypass (the toe) into the coronary according to several optimality criteria.
A Fast Feature Selection Model for Online Handwriting Symbol Recognition
Authors: B. Q. Huang, M-T. Kechadi
Venue: Proceedings of the 5th International Conference on Machine Learning and Applications (2006)

Many feature selection models have been proposed for online handwriting recognition. However, most of them require expensive computational overhead, or inaccurately find an improper feature set which leads to unacceptable recognition rates. This paper presents a new efficient feature selection model for handwriting symbol recognition by using an improved sequential floating search method coupled with a hybrid classifier, which is obtained by combining Hidden Markov Models with Multilayer Forward Network. The effectiveness of proposed method is verified by comprehensive experiments based on UNIPEN database.
Fuzzy-Rough Set Aided Sentence Extraction Summarization
Authors: Hsun-Hui Huang, Yau-Hwang Kuo, Horng-Chang Yang
Venue: Proceedings of the First International Conference on Innovative Computing, Information and Control - Volume 1 (2006)

In this paper, a novel method is proposed to extract key sentences of a document as its summary by estimating the relevance of sentences through the use of fuzzy-rough sets. This method uses senses rather than raw words to lessen the problem that sentences of the same or similar semantic meaning but written in synonyms are treated differently. Also included is semantic clustering, used to avoid selecting redundant key sentences. A prototype of this automatic text summarization scheme is constructed and an intrinsic method with criteria widely used in informationretrieval systems is employed for measuring the summary quality. The results of applying the prototype to datasets with manually-generated summaries are shown.
Self-archiving and the Copyright Transfer Agreements of ISI-ranked library and information science journals
Authors: Anita Coleman
Venue: Journal of the American Society for Information Science and Technology (2007)

A study of Thomson-Scientific ISI ranked Library and Information Science (LIS) journals (n = 52) is reported. The study examined the stances of publishers as expressed in the Copyright Transfer Agreements (CTAs) of the journals toward self-archiving, the practice of depositing digital copies of one's works in an Open Archives Initiative (OAI)-compliant open access repository. Sixty-two percent (32) do not make their CTAs available on the open Web; 38&percnt; (20) do. Of the 38&percnt; that do make CTAs available, two are open access journals. Of the 62&percnt; that do not have a publicly available CTA, 40&percnt; are silent about self-archiving. Even among the 20 journal CTAs publicly available there is a high level of ambiguity. Closer examination augmented by publisher policy documents on copyright, self-archiving, and instructions to authors reveals that only five, 10&percnt; of the ISI-ranked LIS journals in the study, actually prohibit self-archiving by publisher rule. Copyright is a moving target, but publishers appear to be acknowledging that copyright and open access can co-exist in scholarly journal publishing. The ambivalence of LIS journal publishers provides unique opportunities to members of the community. Authors can self-archive in open access archives. A society-led, global scholarly communication consortium can engage in the strategic building of the LIS information commons. Aggregating OAI-compliant archives and developing disciplinary-specific library services for an LIS commons has the potential to increase the field's research impact and visibility. It may also ameliorate its own scholarly communication and publishing systems and serve as a model for others. &copy; 2007 Wiley Periodicals, Inc.
Maximizing network lifetime of broadcasting over wireless stationary ad hoc networks
Authors: Intae Kang, Radha Poovendran
Venue: Mobile Networks and Applications (2005)

We investigate the problem of extending the network lifetime of a single broadcast session over wireless stationary ad hoc networks where the hosts are not mobile. We define the network lifetime as the time from network initialization to the first node failure due to battery depletion. We provide through graph theoretic approaches a polynomial-time globally optimal solution, a variant of the minimum spanning tree (MST), to the problem of maximizing the static network lifetime. We make use of this solution to develop a periodic tree update strategy for effective load balancing and show that a significant gain in network lifetime over the optimal static network lifetime can be achieved. We provide extensive comparative simulation studies on parameters such as update interval and control overhead and investigate their impact on the network lifetime. The simulation results are also compared with an upper bound to the network lifetime.
Multi-agent Software Tool for Management of Design Process in Microelectronics
Authors: Vladimir Gorodetsky, Oleg Karsaev, Victor Konushy, Wolf-Ekkehard Matzke, Eyck Jentzsch, Vadim Ermolayev
Venue: Proceedings of the IEEE/WIC/ACM international conference on Intelligent Agent Technology (2006)

The paper presents a software tool to support the management of design process in microelectronics. It is developed as a multi-agent prototype intended for automated project planning, scheduling and simulation as well as project tracking and control while managing cooperative work of a design team.
Image Retrieval-Based Decision Support System for Dermatoscopic Images
Authors: Md. Mahmudur Rahman, Bipin C. Desai, Prabir Bhattacharya
Venue: Proceedings of the 19th IEEE Symposium on Computer-Based Medical Systems (2006)

This paper presents a content-based image retrieval system for dermatoscopic images as a diagnostic aid to the dermatologists for skin cancer recognition. In this context, the ultimate aim is to support decision making by locating, retrieving and displaying relevant past cases along with diagnostic reports. However, most challenging aspect in this domain is to extract local lesion specific image features and define the relevance between query and database images for retrieval. A fast and automatic segmentation method to detect the lesion from background healthy skin is proposed. This method first transforms a color image into an intensity image by utilizing domain specific image properties and NBS color distance in HVC color space. Lesion mask is detected by fusing individually segmented images based on iterative thresholding. Lesion specific local color and texture features are extracted and represented in the form of mean and variance-covariance of color channels and in a reduced PCA sub-space. Finally, for effective image retrieval, a similarity matching function is defined based on the fusion of a Bhattacharyya and Euclidean distance metric. The performance of the retrieval system is evaluated using average precision on a collection of 358 images, which demonstrates effectiveness of the proposed approach.
Calendar maintenance of arbitrarily structured systems
Authors: Yu. Ye. Objerin, A. I. Peschansky
Venue: Cybernetics and Systems Analysis (2006)

A semi-Markov model is constructed that describes an arbitrarily structured multicomponent technological system and takes into account its calendar maintenance. Using an aggregation algorithm, approximate values of stationary reliability characteristics and an optimal term of maintenance work are determined for the system.
Hemispheric Asymmetry in Categorical Versus Coordinate Visuospatial Processing Revealed by Temporary Cortical Deactivation
Authors: Scott D. Slotnick, Lauren R. Moo, Mark A. Tesoro, John Hart
Venue: Journal of Cognitive Neuroscience (2001)

Kosslyn (1987) proposed that the left hemisphere is better than the right hemisphere at categorical visuospatial processing while the right hemisphere is better than the left hemisphere at coordinate visuospatial processing. In 134 patients, one hemisphere (and then usually the other) was temporarily deactivated by intracarotid injection of sodium amobarbital. After a hemisphere was deactivated, a cognitive test battery was conducted, which included categorical and coordinate visuospatial tasks. Using this technique, the processing capabilities of the intact hemisphere could be determined, thus directly testing Kosslyn's hypothesis regarding hemispheric specialization. Specifically, if the left hemisphere does preferentially process categorical visuospatial relationships, then its deactivation should result in more errors during categorical tasks than right hemisphere deactivation and vise versa for the right hemisphere regarding coordinate tasks. The pattern of results obtained in both categorical and coordinate tasks was consistent with Kosslyn's hypothesis when task difficulty was sufficiently high. However, when task difficulty was low, a left hemispheric processing advantage was found for both types of tasks indicating that: (1) the left hemisphere may be better at "easy" tasks regardless of the type of task and (2) the proposed hemispheric processing asymmetry may only become apparent during sufficiently demanding task conditions. These results may explain why some investigators have failed to find a significant hemispheric processing asymmetry in visuospatial categorical and coordinate tasks.
Motion Perception in Autism: A "Complex" Issue
Authors: Armando Bertone, Laurent Mottron, Patricia Jelenic, Jocelyn Faubert
Venue: Journal of Cognitive Neuroscience (2003)

We present the first assessment of motion sensitivity for persons with autism and normal intelligence using motion patterns that require neural processing mechanisms of varying complexity. Compared to matched controls, our results demonstrate that the motion sensitivity of observers with autism is similar to that of nonautistic observers for different types of first-order (luminance-defined) motion stimuli, but significantly decreased for the same types of second-order (texture-defined) stimuli. The latter class of motion stimuli has been demonstrated to require additional neural computation to be processed adequately. This finding may reflect less efficient integrative functioning of the neural mechanisms that mediate visuoperceptual processing in autism. The contribution of this finding with regards to abnormal perceptual integration in autism, its effect on cognitive operations, and possible behavioral implications are discussed.
Achievements and Experiences from a Grid-Based Earthquake Analysis and Modelling Study
Authors: Jian Guo Liu, Moustafa Ghanem, Vasa Curcin, Christian Haselwimmer, Yike Guo, Gareth Morgan, Kyran Mish
Venue: Proceedings of the Second IEEE International Conference on e-Science and Grid Computing (2006)

We have developed and used a grid-based geoinformatics infrastructure and analytical methods for investigating the relationship between macro and microscale earthquake deformational processes by linking geographically distributed and computationally intensive earthquake monitoring and modelling tools. Using this infrastructure, measurement of lateral co-seismic deformation is carried out with imageodesy algorithms running on servers at the London eScience Centre. The resultant deformation field is used to initialise geomechanical simulations of the earthquake deformation running on supercomputers based at the University of Oklahoma. This paper describes the details of our work, summarizes our scientific results and details our experiences from implementing and testing the distributed infrastructure and analysis workflow.
Test Data Compression Based on Clustered Random Access Scan
Authors: Yu Hu, Cheng Li, Jia Li, Yin-He Han, Xiao-Wei Li, Wei Wang, Hua-Wei Li, Laung-Terng(L. T) Wang, Xiao-Qing Wen
Venue: Proceedings of the 15th Asian Test Symposium (2006)

We proposed a Clustered Random Access Scan (CRAS) architecture to reduce test data volume. CRAS makes use of the compatibility of the test stimuli to cluster the scan cells, and assigns every cluster a unique address. The compression ratio upper bound of CRAS is analyzed based on the random graph theory. Experimental results on ISCAS'89 benchmarks and two industry designs show that the proposed CRAS architecture can yield on average 67.3% reduction in test data volume, with reasonable area and routing overhead than scan design.
Supporting virtual organisation alliances with relative workflows
Authors: Xiaohui Zhao, Chengfei Liu, Yun Yang
Venue: Proceedings of the 3rd Asia-Pacific conference on Conceptual modelling - Volume 53 (2006)

Driven by the fast changing service demand-and-supply requirements, virtual organisation alliances are created to adapt highly dynamic B2B collaborations. However, the temporary partnership and low trustiness between collaborating organisations raise challenges to effectively manage collaborative business processes. This paper presents an approach on the basis of a service oriented relative workflow model to support virtual organisation alliances. This approach takes an organisation centred design method and deploys a visibility mechanism to provide a finer granularity of authority control at contracting and collaboration design phases. The open contracting and inter-organisational collaboration design in a virtual organisation alliance are particularly addressed and discussed in this paper
Intact Motor Imagery in Chronic Upper Limb Hemiplegics: Evidence for Activity-Independent Action Representations
Authors: Scott H. Johnson, Gwen Sprehn, Andrew J. Saykin
Venue: Journal of Cognitive Neuroscience (2002)

Four experiments were undertaken to examine the effects of chronic hemiplegia on the ability to internally represent actions involving either the paralyzed (contralesional) or relatively unaffected (ipsilesional) limb. An experimental group of chronic, densely hemiplegic patients was compared with controls who experienced nearly full recovery from an initially dense hemiparesis. All participants suffered cerebral vascular accidents that spared sites in premotor and parietal areas directly involved in representing upper limb actions. Despite chronic limb immobility, hemiplegic patients performed all four tasks at a high level of accuracy and showed no differences in their ability to represent actions of the contralesional versus ipsilesional limbs. On tasks that involved representing actions of the hands and lower arms, hemiplegic patients were as accurate as recovered controls. Hemiplegic patients were, however, less accurate than controls on a task that involved representing actions of either upper arm. Overall, chronic hemiplegics performed more accurately for decisions based on their contralesional limbs: a "hemiplegic advantage" that may be related to an ongoing focus on planning and/or imagining currently impossible movements. These findings reveal a dissociation between the ability to internally "represent" versus "produce" manual actions. Further, they demonstrate that internal action representations can be robust to even years of limb disuse.
Grid Graph Reachability Problems
Authors: Eric Allender, David A. Mix Barrington, Tanmoy Chakraborty, Samir Datta, Sambuddha Roy
Venue: Proceedings of the 21st Annual IEEE Conference on Computational Complexity (2006)

We study the complexity of reachability problems on various classes of grid graphs. Reachability on certain classes of grid graphs gives natural examples of problems that are hard for NC^1 under AC^0 reductions but are not known to be hard for L; they thus give insight into the structure of L. In addition to explicating the structure of L, another of our goals is to expand the class of digraphs for which connectivity can be solved in logspace, by building on the work of Jakoby et al. [14], who showed that reachability in series-parallel digraphs is solvable in L. We show that reachability for single-source multiple-sink planar dags is solvable in L.