ppxscal/embedding_network huggingface dataset:
Electrical properties of ErSi2 nanowires formed on Si substrates
Authors: Satoshi Yokoyama, Yusuke Katayama, Tomohiro Kobayashi, Takashi Meguro, Xinwei Zhao
Venue: Microelectronic Engineering (2008)

ErSi"2 nanowires (NWs) were formed on Si (110) substrates by a self-assembly process. The wires were highly parallel and grew along the Si crystal direction. There were two types of ErSi"2 NWs on the same Si (110) surface; these were formed during the same annealing process. One consisted of very wide type wires, having widths of 100nm, and the other of narrow wires, with widths of less than 50nm. Current-voltage measurements were carried out for the two types of ErSi"2 NWs. The deference in resistivity of the wide and narrow wires is discussed based on the structural investigation.
Intelligent Vision Processor
Authors: John Morris, Georgy Gimel'farb, Hani Akeila, Robert Mckay, Jack Woon
Venue: Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics - Volume 02 (2008)

It is easy to give a robot or other device trying to emulate human ability an ‘eye’. Some cameras even exceed the powers of human eyes, but the computations just to measure depth (without interpreting the scene further) are handled by our brain’s extraordinary parallel capabilities and are beyond the ability of any modern single processor. We describe an implementation of a vision system in reconfigurable hardware which measures scene depths at 25 fps in 1 Mpixel images. This implementation uses lookup tables to remove camera distortions and misalignments and Symmetric Dynamic Programming Stereo for matching. It produces depth maps with latencies
A priority-aware CSMA/CP MAC protocol for the all-optical IP-over-WDM metropolitan area ring network
Authors: Jih-Hsin Ho, Wen-Shyang Hwang, Ce-Kuen Shieh
Venue: Journal of High Speed Networks (2007)

The paper proposes a priority-aware MAC (Medium Access Control) protocol for a core metropolitan area network in the next generation Internet, which is an OPS (Optical Packet Switch) network that all-optically and directly transfers IP packets over a WDM (Wavelength Division Multiplexing) ring network. It uses the concepts of CSMA (Carrier Sense Multiple Access), CP (Carrier Preemption), and the priority mechanism to support all-optical and priority-aware transferring of the IP packets of the nodes in the WDM ring networks; the new MAC protocol is named priority-aware CSMA/CP. Since the traditional IP provides the best effort service only, supporting IP packets with QoS transfer has become a crucial issue for multimedia transmission. Today, while the network bandwidth has grown dramatically, the kind of applications transferred are mostly high-bandwidth demanding multimedia transmissions. It is predictable that the end-to-end QoS will be an important area of study in the next generation Internet. This paper accordingly proposes an advanced mechanism for this, and gives a differential service model to analyze and simulate the average packet delay for each class.
Dynamic Structure DEVS: Improving the Real-Time Embedded Systems Simulation and Design
Authors: Hui Shang, Gabriel A. Wainer
Venue: Proceedings of the 41st Annual Simulation Symposium (anss-41 2008) (2008)

We present an improved simulation engine that combines Dynamic Structure DEVS with a real time simulation engine (eCD++). The improved simulation engine is implemented includes an advanced dynamic structure real-time experimental environment to adjust the model structure automatically according to the changes in the internal/external environments. The existing abstract simulators were redefined to adapt to dynamic structure. In addition, a new abstract simulator implements the structural change behaviour of Structure Agent that executes the structural changes.
COMBINING MULTIPLE CLASSIFIERS USING DEMPSTER'S RULE FOR TEXT CATEGORIZATION
Authors: Yaxin Bi, David Bell, Hui Wang, Gongde Guo, Jiwen Guan
Venue: Applied Artificial Intelligence (2007)

In this paper we investigate the combination of four machine learning methods for text categorization using Dempster's rule of combination. These methods include Support Vector Machine (SVM), kNN (Nearest Neighbor), kNN model-based approach (kNNM), and Rocchio. We first present a general representation of the outputs of different classifiers, in particular, modeling it as a piece of evidence by using a novel evidence structure called focal element triplet. Furthermore, we investigate an effective method for combining pieces of evidence derived from classifiers generated by a 10-fold cross-validation. Finally, we evaluate our methods on the 20-newsgroup and Reuters-21578 benchmark data sets and perform the comparative analysis with majority voting in combining multiple classifiers along with the previous result. Our experimental results show that the best combined classifier can improve the performance of the individual classifiers and Dempster's rule of combination outperforms majority voting in combining multiple classifiers.
Internet Usage Monitoring in the Workplace: Its Legal Challenges and Implementation Strategies
Authors: H. Joseph Wen, Dana Schwieger, Pam Gershuny
Venue: Information Systems Management (2007)

With the introduction of any new technology, there is also the potential for its misuse, yet no U.S. federal or state statute currently prohibits employers from monitoring their electronic workplace. In this article, we review surveillance technologies and discuss the related federal and state laws along with U.S. judicial decisions. Implementation strategies to help employers defuse or avoid the negative aspects of monitoring are provided.
Runtime failure detection
Authors: Jochen Wuttke
Venue: Companion of the 30th international conference on Software engineering (2008)

We propose a model-driven methodology to generate and automatically deploy runtime failure detectors that enable self-healing software to deal with functional failures. The methodology rests on addressing key research challenges: (1) Identifying classes of properties specified in end-user requirements, which can be associated with typical integration failures. (2) Designing runtime efficient detectors for these failures. (3) Defining mappings of entities between the domain of end-user requirements and the design model.
Parallel Sorting on the Biswapped Network
Authors: Wenhong Wei, Wenjun Xiao, Zhen Zhang
Venue: Proceedings of the Seventh IEEE/ACIS International Conference on Computer and Information Science (icis 2008) (2008)

Biswapped network (BSN) is a recently proposed network model of parallel computing, which is built of 2n copies of an n-node basic network, and its basic network may be hypercube, mesh and other networks, hence we can construct BSN-Hypercube and BSN-Mesh by using hypercube and mesh as basic network. BSN uses a simple rule for connectivity to ensure its regularity and some topological properties of BSN have been investigated. In this paper, we present sorting algorithm on the n processors BSN whose basic network has Hamiltonian path, and if the basic network of BSN is mesh, sorting n unordered elements will complete in time (2n)^1(1/2)+O(n^(3/4)).
Stable and Energy Efficient Routing for Mobile Adhoc Networks
Authors: Vinay Rishiwal, Ashwani Kush, Shekhar Verma
Venue: Proceedings of the Fifth International Conference on Information Technology: New Generations (2008)

Mobile Ad hoc networking is a challenging task due to the lack of resources in the network as well as the frequent changes in network topology. Although lots of research has been done on supporting QoS in the Internet and other networks, but they are not suitable for mobile Ad hoc networks and still QoS support for such networks remains an open problem. In this paper, a new scheme has been proposed for achieving QoS in terms of packet delivery, multiple connections, better power management and stable routes. It offers quick adaptation to distributed processing, dynamic linking, low processing overhead and loop freedom at all times. The proposed scheme has been incorporated using AODV protocol and by extensive simulation the performance has been studied, and it is clearly shown that the proposed scheme performs very well for different network scenarios.
Automated Classification of Port-Scans from Distributed Sensors
Authors: Hiroaki Kikuchi, Naoya Fukuno, Tomohiro Kobori, Masato Terada, Tangtisanon Pikulkaew
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications (2008)

Computer worms randomly perform port-scans to find vulnerable hosts to intrude over the Internet. Malicious software varies its port-scan strategy, e.g., some hosts intensively perform scans on a particular target and some hosts scan uniformly over IP address blocks. In this paper, we propose a new automated worm classification scheme from distributed observations. Our proposed scheme can detect some statistics of worm behavior with a simple decision tree consisting of some nodes to classify source addresses with optimal threshold values. The choice of thresholds is automated to minimize the entropy gain of classification. Once a tree is constructed, the classification can be done very quickly and accurately. In this paper, we analyze a set of source addresses observed by the distributed sensors in ISDAS observed with 30 sensors in one year in order to clarify a primary statistics of worms. Based on the statistical characteristics, we present the proposed classification and show the performance of the proposed scheme.
Leadership: an action research approach
Authors: Nazir Walji
Venue: AI Society (2008)

The role of leadership in the twenty-first century is challenging and varied, with changes often impacting across national borders. Leadership is a process, involving reciprocal influence. It has shortcomings and limitations, but in optimum conditions it can harmoniously harness and synthesize relevant knowledge, make sense of environmental features and changes, and co-generate new knowledge, usually in response to strategic demands and exigencies. Leadership responsibilities are all encompassing and require a holistic overview. Participatory action research is the chosen methodological vehicle, supported by various research instruments. There is ongoing active engagement, including with a non-governmental organisation ABC, where the researcher has an advisory role.
Large-scale testing of the Internet's Border Gateway Protocol (BGP) via topological scale-down
Authors: Glenn Carl, George Kesidis
Venue: ACM Transactions on Modeling and Computer Simulation (TOMACS) (2008)

The Internet is a critical communication infrastructure servicing billions of end-users world-wide. Ongoing studies of the Internet's operations show that data loss and increased latency are occurring due to weaknesses in its interdomain routing protocol, BGP. Many solutions have been proposed, but few have experienced widespread adoption. Both the delayed discovery of the protocol's shortcomings, and apathy for its proposed solutions, are partially due to inadequate testing practices. Internet interdomain routing technologies are not evaluated at appropriate scale. Better testing is suggested, which incorporates the specification of large-scale experimental topologies. This is necessary, as BGP performs the distributed operation of interdomain routing across the thousands of networks composing the Internet. However, only small to moderately sized topologies can be currently accommodated by today's testing platforms. A modeling methodology based on path preserving scale-down is proposed to extend the topological scale of interdomain routing experimentation. A given Internet topology is reduced in terms of its autonomous systems (ASes) using a combination of Gaussian elimination and several graphical heuristics. The interdomain routing paths generated by BGP on this reduced topology are also preserved. Path preservation keeps the length, composition, and ordering of these routing paths unchanged. When the routing paths guiding Internet traffic among ASes are preserved across the size reduction, the large-scale traffic engineering induced by BGP can be estimated at much lower scales. Internet data losses due to certain inappropriate interdomain routing behaviors can be identified. As an example, a persistent multiple origin autonomous system (MOAS) conflict is characterized over a topology containing 8826 ASes. It is shown that this problem's large-scale characterization can be obtained using scale-down models that are 70&percnt; smaller, and thus more accommodating to common testing platforms (e.g., simulation and networking testbeds).
A Method for Extracting 3D Information of Cylinder in C-arm Image
Authors: Jian Wu
Venue: Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics - Volume 02 (2008)

Aiming at the failure of the distal locking in the computer assisted distal locking of intramedullary nails because of the intersection angle between the nail hole axis and the projection axis of the C-arm, a method of three-dimensional information estimation of the nail hole from two-dimensional X-ray image coordinates was proposed, basing on the perspective projection mode of the C-arm and the reduction of the nail hole to a cylinder. Due to the characteristics of the cylinder, we proposed a sampling points coordinates’ modification method basing on the different coordinates compensation to distinguish the projection ellipse’s parameters estimation of the top and bottom caps of the cylinder. The simulation results showed that the ellipse’s parameters estimation had less effect on the 3-D information estimation of the cylinder, while the C-arm’s stability significantly affects the calculation precision of the Z-axis of the cylinder position. After the sample points’ coordinates’ compensation for the ellipse detection, the estimation precision of the cylinder’s location is improved.
On the efficient construction of quasi-reversible automata for reversible languages
Authors: Pedro García, Manuel Vázquez de Parga, Damián López
Venue: Information Processing Letters (2008)

Quasi-reversible automata is a suitable representation for reversible languages. In this work a method is proposed to obtain such an automaton for any given reversible language represented by its minimal DFA. Our method runs in polynomial time respect to the size of the minimal DFA and improves a previous exponential method. Previous bound for the size of quasi-reversible automata is also reduced.
Modeling, scheduling, and simulation of switched processing systems
Authors: Ying-Chao Hung, George Michailidis
Venue: ACM Transactions on Modeling and Computer Simulation (TOMACS) (2008)

Switched Processing Systems (SPS) serve as canonical models in a wide area of applications such as high performance computing, wireless networking, call centers, and flexible manufacturing. In this article, we model the SPS by considering both slotted and continuous time and analyze it under fairly mild stochastic assumptions. Two classes of scheduling policies are introduced and shown to maximize the throughput and maintain strong stability of the system. In addition, their performance with respect to the average job sojourn time is examined by simulating small SPS subject to different types of input traffic. By utilizing the simulation result of the proposed policies, a hybrid control policy is constructed to reduce the average job sojourn time when the system has unknown and changing input loads.
The design of high-performance dynamic asynchronous pipelines: lookahead style
Authors: Montek Singh, Steven M. Nowick
Venue: IEEE Transactions on Very Large Scale Integration (VLSI) Systems (2007)

A new class of asynchronous pipelines is proposed, called lookahead pipelines (LP), which use dynamic logic and are capable of delivering multi-gigahertz throughputs. Since they are asynchronous, these pipelines avoid problems related to high-speed clock distribution, such as clock power, management of clock skew, and inflexibility in handling varied environments. The designs are based on the well-known PSO style of Williams and Horowitz as a starting point, but achieve significant improvements through novel protocol optimizations: the pipeline communication is structured so that critical events can be detected and exploited earlier. A special focus of this work is to target extremely fine-grain or gate-level pipelines, where the datapath is sectioned into stages, each consisting of logic that is only a single level deep. Both dual-rail and single-rail pipeline implementations are proposed. All the implementations are characterized by low-cost control structures and the avoidance of explicit latches. Post-layout SPICE simulations, in 0.18-µm technology, indicate that the best dual-rail LP design has more than twice the throughput (1.04 giga data items/s) of Williams' PSO design, while the best single-rail LP design achieves even higher throughput (1.55 giga data items/s).
A Lightweight Fault-Tolerant Mechanism for Network-on-Chip
Authors: Michihiro Koibuchi, Hiroki Matsutani, Hideharu Amano, Timothy Mark Pinkston
Venue: Proceedings of the Second ACM/IEEE International Symposium on Networks-on-Chip (2008)

Survival capability is becoming a crucial factor in designing multicore processors built with on-chip packet networks, or networks on chip (NoCs). In this paper, we propose a lightweight fault-tolerant mechanism for NoCs based on default backup paths (DBPs) designed to maintain, in the presence of failures, network connectivity of both non-faulty routers as well as healthy processor cores which may be connected to faulty routers. The mechanism provides default paths as backup between certain router ports which serve as alternative datapaths to circumvent failed components within a faulty router. Along with a minimal subset of normal network channels, the set of default backup paths internal to faulty routers form---in the worst case---a unidirectional ring topology that provides network-wide connectivity to all processor cores. Routing using the DBP mechanism is proved to be deadlock-free with only two virtual channels even for fault scenarios in which regular networks degrade to irregular (arbitrary) topologies. Evaluation results show that, for a 2-D mesh wormhole NoC, only 12.6% additional hardware resources are needed to implement the proposed DBP mechanism in order to provide graceful performance degradation without chip-wide failure as the number of faults increases to the maximum needed to form ring.
Predicting effectiveness of children participants in user testing based on personality characteristics
Authors: Wolmet Barendregt, Mathilde M. Bekker, Don G. Bouwhuis, Esther Baauw
Venue: Behaviour & Information Technology (2007)

This paper describes an experiment to determine which personality characteristics can be used to predict whether a child will make an effective participant in a user test, both in terms of the number of identified problems and the percentage of verbalised problems. Participant selection based on this knowledge can make user testing with young children more effective. The study shows that the personality characteristic Curiosity influences the number of identified problems; a combination of the personality characteristics Friendliness and Extraversion influences the percentage of verbalised problems. Furthermore, the study shows that selection of children based on these criteria does not lead to finding an unrepresentative sample of the product's problems.
Storage fusion
Authors: Masaru Kitsuregawa, Kazuo Goda, Takashi Hoshino
Venue: Proceedings of the 2nd international conference on Ubiquitous information management and communication (2008)

So far, the core component of the IT system was absolutely a server, and the storage was recognized as its peripheral. The recent evolution of device and network technologies has enabled storage consolidation, by which all the data and its related simple software codes can be placed in one place. Storage centric designs are being deployed into many enterprise systems. The role of the storage should be reconsidered. This paper presents activities of the Storage Fusion Project, a five-year research and development project. Storage Fusion is an idea of elegant deep collaboration between storage and database servers. Two substantial works are presented in this paper. First, the exploitation of query execution plans enables dynamically informed prefetching, accordingly boosting ad-hoc queries significantly. Second, the idea of putting autonomic database reorganization into the storage has the potential benefit of relieving the management burdens of database structural deterioration.
Graph mining based on a data partitioning approach
Authors: Son N. Nguyen, Maria E. Orlowska, Xue Li
Venue: Proceedings of the nineteenth conference on Australasian database - Volume 75 (2008)

Existing graph mining algorithms typically assume that the dataset can fit into main memory. As many large graph datasets cannot satisfy this condition, truly scalable graph mining remains a challenging computational problem. In this paper, we present a new horizontal data partitioning framework for graph mining. The original dataset is divided into fragments, then each fragment is mined individually and the results are combined together to generate a global result. One of the challenging problems in graph mining is about the completeness because the of complexity graph structures. We will prove the completeness of our algorithm in this paper. The experiments will be conducted to illustrate the efficiency of our data partitioning approach.
Parametric synthesis method of integral systems on the basis of root locus curves of Kharitonov polynomials
Authors: A. A. Nesenchuk, S. M. Fedorovich
Venue: Automation and Remote Control (2008)

The method is developed for the synthesis of a stable set of characteristic polynomials of an interval dynamic system on the basis of the initial unstable set with the use of the system model in the form of a free root portrait. The synthesis is carried out by changing the boundaries (adjustment) of the interval of uncertainty of a free polynomial term, which enables affording the stability without a change of the configuration of the root portrait of the system. As a criterion of the adjustment, the distance is assigned that is measured along trajectories of the root portrait; in particular, a new polynomial can be defined by the nearest polynomial to the prescribed one with due regard for requirements of the quality of the system.
k-Bounded classes of dominant-independent perfect graphs
Authors: Igor E. Zverovich
Venue: Journal of Graph Theory (1999)

Let &alpha;(G), &gamma;(G), and i(G) be the independence number, the domination number, and the independent domination number of a graph G, respectively. For any k &ge; 0, we define the following hereditary classes: &alpha;i(k) = {G : &alpha;(H) - i(H) &le; k for every H &epsilon; ISub(G)}; &alpha;&gamma;(k) = {G : &alpha;(H) - &gamma;(H) &le; k for every H &epsilon; ISub(G)}; and i&gamma;(k) = {G : i(H) - &gamma;(H) &le; k for every H &epsilon; ISub(G)}, where ISub(G) is the set of all induced subgraphs of a graph G. In this article, we present a finite forbidden induced subgraph characterization for &alpha;i(k) and &alpha;&gamma;(k) for any k &ge; 0. We conjecture that i&gamma;(k) also has such a characterization. Up to the present, it is known only for i&gamma;(0) (domination perfect graphs [Zverovich Zverovich, J Graph Theory 20 (1995), 375395]). &copy; 1999 John Wiley Sons, Inc. J Graph Theory 32: 303310, 1999