ppxscal/embedding_network huggingface dataset:
Communication and Synchronization in Distributed Systems
Authors: A. Silberschatz
Venue: IEEE Transactions on Software Engineering (1979)

Recent advances in technology have made the construction of general-purpose systems out of many small independent microprocessors feasible. One of the issue's concerning distributed systems is the question of appropriate language constructs for the handling of communication and synchronization. In his paper, "Communicating sequential processes," Hoare has suggested the use of the input and output constructs and Dijkstra's guarded commands to handle these two issues. This paper examines Hoare's concepts in greater detail by concentrating on the following two issues: 1) allowing both input and output commands to appear in guards, 2) sinple abstract implementation of the input and output constructs.
An Evaluation of Traceability Approaches to Support Software Evolution
Authors: Siti Rochimah, Wan M. N. Wan Kadir, Abdul H. Abdullah
Venue: Proceedings of the International Conference on Software Engineering Advances (2007)

Requirements traceability is becoming increasingly significant element in software engineering. It provides critical function in the development and maintenance of a software system. From the software evolution point of view, requirements traceability plays an important role in facilitating software evolution. Since the evolution is inevitable, a traceability approach must take as much as possible the important influencing aspects into account to the evolution processes in order to minimize the evolution efforts. This paper evaluates several recent traceability approaches published in literature with the focus on their contributions to software evolution. The evaluation results may be used as a basis for improving requirements traceability approaches that may simplify the software evolution tasks.
Weaving Versus Blending: a quantitative assessment of the information carrying capacities of two alternative methods for conveying multivariate data with color.
Authors: Haleh Hagh-Shenas, Sunghee Kim, Victoria Interrante, Christopher Healey
Venue: IEEE Transactions on Visualization and Computer Graphics (2007)

In many applications, it is important to understand the individual values of, and relationships between, multiple related scalar variables defined across a common domain. Several approaches have been proposed for representing data in these situations.In this paper we focus on strategies for the visualization of multivariate data that rely on color mixing.In particular, through a series of controlled observer experiments, we seek to establish a fundamental understanding of the information-carrying capacities of two alternative methods for encoding multivariate information using color: color blending and color weaving. We begin with a baseline experiment in which we assess participants' abilities to accurately read numerical data encoded in six different basic color scales defined in the L*a*b* color space. We then assess participants' abilities to read combinations of 2, 3, 4 and 6 different data values represented in a common region of the domain, encoded using either color blending or color weaving. In color blending a single mixed color is formed via linear combination of the individual values in L*a*b* space, and in color weaving the original individual colors are displayed side-by-side in a high frequency texture that fills the region. A third experiment was conducted to clarify some of the trends regarding the color contrast and its effect on the magnitude of the error that was observed in the second experiment. The results indicate that when the component colors are represented side-by-side in a high frequency texture, most participants' abilities to infer the values of individual components are significantly improved, relative to when the colors are blended. Participants' performance was significantly better with color weaving particularly when more than 2 colors were used, and even when the individual colors subtended only 3 minutes of visual angle in the texture. However, the information-carrying capacity of the color weaving approach has its limits.We found that participants' abilities to accurately interpret each of the individual components in a high frequency color texture typically falls off as the number of components increases from 4 to 6. We found no significant advantages, in either color blending or color weaving, to using color scales based on component hues thatare more widely separated in the L*a*b* color space.Furthermore, we found some indications that extra difficulties may arise when opponent hues are employed.
Automatic shoe-pattern boundary extraction by image-processing techniques
Authors: Ming-Yi Lai, Ling-Ling Wang
Venue: Robotics and Computer-Integrated Manufacturing (2008)

A footwear designer digitizes shoe patterns to extract their boundaries, once he finishes 3D shoe-model design, last-bottom flattening, and shoe-pattern making. Shoe-pattern boundaries are then imported to cutting machines to cut material into shoe-pattern shapes. In the shoe-pattern making process, a footwear designer may draw many arcs, lines and pigments on a shoe pattern. Therefore, a shoe pattern has smudges, stains, and marker pen drawings on its surface. It results in the difficulty of automatically digitizing and extracting a shoe-pattern boundary. This study aims to develop an effective image-processing method to automatically extract the boundary of a shoe pattern. In the study, we first use a histogram thresholding technique to segment out a shoe pattern from the scanned input image. Then boundary extraction is applied on the segmented image to detect and smooth the shoe-pattern boundary. Finally, the proposed method is tested and its performance is evaluated. Experimental results indicate that the proposed method is good for automatic shoe-pattern boundary extraction.
Load Balanced Parallel Prime Number Generator with Sieve of Eratosthenes on Cluster Computers
Authors: Soonwook Hwang, Kyusik Chung, Dongseung Kim
Venue: Proceedings of the 7th IEEE International Conference on Computer and Information Technology (2007)

Algorithms of finding prime numbers up to some integer N by Sieve of Eratosthenes are simple and fast. However, even with the time complexity no greater than O(N ln ln N), it may take weeks or even years of CPU time if N is large like over 15 decimal digits. No known shortcut was reported yet. We develop efficient parallel algorithms to balance the workload of each computer, and to extend memory limit with disk storage to accommodate Giga-bytes of data. Our experiments show that a complete set of up to 14-digit prime numbers can be found in a week of computing time (CPU time) using our 8 1.6GHz Pentium-4 PCs with Linux and MPI library. Also, by sieve of Eratosthenes, we think it is very unlikely that we can compute all primes up to 20 digits even using the fastest computers in the world. Key words: prime number, sieve of Eratosthenes, load balancing, MPI, cluster computer
An intelligent tutoring system for education by web
Authors: W. Fajardo Contreras, E. Gibaja Galindo, E. Marín Caballero, G. Marín Caballero
Venue: Proceedings of the sixth conference on IASTED International Conference Web-Based Education - Volume 2 (2007)

In recent times, it has been seen that the personalized teaching to each pupil favours learning due to an individualized tracking is done to him/her. The goal of this work is doing a personalized tracking of very pupil. The system presented is able to adapt the educational material to the level of every student. It also fulfils the requirements of e-learning technology and provides various accessing levels (administrator, teacher, student and user). Our system tries to reproduce a real e-learning centre with administrative and learning components. The teaching component cannot be solved in a trivial form, rather it requires the use of knowledge engineering and artificial intelligence techniques.
Approximate Solution of Queueing Models
Authors: C. H. Sauer
Venue: Computer (1980)

A variety of phenomena and interactions defy exact analytic modeling. Approximation can provide a reasonably accurate solution of a realistic model and is computationally inexpensive.
Interactive Use of Problem Knowledge for Clustering and Decision Making
Authors: E. A. Patrick, L. Y. L. Shen
Venue: IEEE Transactions on Computers (1971)

An approach to clustering and decision making is presented where a prior problem knowledge is inserted interactively. The problem knowledge inserted is in the form of subcategory mean vectors and covariance matrices and in the expert's confidence that these means and covariances accurately characterize the category. Then observations of patterns from the category are used to update these a priori supplied means and covariances. The extent to which new observations update the a priori values depends upon the expert's a priori confidence.
Automated management and service provisioning model for distributed devices
Authors: Erhan Mengusoglu, Brian Pickering
Venue: Proceedings of the 2007 workshop on Automating service quality: Held at the International Conference on Automated Software Engineering (ASE) (2007)

This paper provides an automated system management and service provisioning approach for distributed devices. We consider a functional process model of the necessary phases for runtime management (MAPE-K proposal from the Autonomic Computing Initiative). This approach defines discrete steps within runtime system management which provide a simplified view of the system for service provisioning. Two issues emerge: communication from managed entities (or monitoring) may need special consideration; and this leads on to modeling communication between the system management phases proposed by MAPE-K.
B74-13 Operating Systems Infotech State of the Art Report # 14.
Authors: P. Freeman
Venue: IEEE Transactions on Computers (1974)

This is another in a series of state-of-the-art reports from Infotech. It consists of edited discussions and presentations plus invited papers. Because a volume of this price will most likely not be sent out on approval, I think it important to review briefly the contents in detail before commenting on their value. 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
A Nand Model ror Fault Diagnosis in Combinational Logic Networks
Authors: J. P. Hayes
Venue: IEEE Transactions on Computers (1971)

A network model colled the normal NAND model is introduced for the study of fault diagnosis in combinational logic circuits. It is shown that every network can be transformed into an equivalent normal NAND network from which all the information pertaining to the diagnosis of the original network con be obtained. The use of this model greatly simplifies fault analysis and test generation.
Aerodynamic Parameter Fitting Based on Robust Least Squares Support Vector Machines
Authors: Xusheng Gan, Hongcai Zhang, Yongmei Cheng, Chao Shi
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 02 (2007)

Main advantage of LS-SVM is computationally more efficient than the standard SVM. But unfortunately the sparseness of standard SVM is lost, another problem is that LS-SVM is only optimal if the training samples are corrupted by Gaussian noise. In this paper, a new modified version, robust LS-SVM, which can obtain robust estimates by applying a weighted LS-SVM and achieve the sparseness by doing pruning based upon the sorted support value spectrum, is adopted and introduced into the aerodynamic parameter fitting. The simulation results indicate that robust LS-SVM has a better fitting of aerodynamic parameter with features of simplicity, precision and rapidness to learn.
A Formal Approach to Designing Anonymous Software
Authors: Yoshinobu Kawabe, Hideki Sakurada
Venue: Proceedings of the 5th ACIS International Conference on Software Engineering Research, Management & Applications (2007)

Many Internet services and protocols should guarantee anonymity; for example, an electronic voting system should guarantee to prevent the disclosure of who voted for which candidate. However, a methodology for designing software that preserves anonymity has not yet been established. In the field of software engineering, it is well known that software correctness can be verified with a formal method. Following the formal method approach, this paper introduces an anonymity proof technique. By finding a condition called an anonymous simulation, we prove the anonymity of communication software. Our approach can deal with both eavesdroppers and stronger adversaries. This paper also demonstrates a formal verification of communication software. We employ Crowds, which is an implementation of an anonymous router, and verify the anonymity. After describing Crowds in a formal specification language, we prove its anonymity with a theorem prover. In this verification, we employ a formal verification tool called IOA-Toolkit.
A seamless context-aware architecture for fourth generation wireless networks
Authors: Ahmed Hasswa, Nidal Nasser, Hossam Hassanein
Venue: Wireless Personal Communications: An International Journal (2007)

The integration of a multitude of wireless networks is expected to lead to the emergence of the fourth generation (4G) of wireless technologies. Under the motivation of increasing the levels of user satisfaction while maintaining seamless connectivity and a satisfactory level of QoS, we design a novel cross-layer architecture that provides context-awareness, smart handoff and mobility control in heterogeneous wireless IP networks. We develop a Transport and Application Layer Architecture for vertical Mobility with Context-awareness (Tramcar). Tramcar presents a new approach to vertical handoff decisions, which is not exclusively based on network characteristics but also on higher level parameters which fall in the application and transport layers. Tramcar is tailored for a variety of different network technologies with different characteristics and has the ability of adapting to changing environment conditions and unpredictable background traffic. Furthermore, Tramcar allows users to identify and prioritize their preferences. Tramcar is a smart and practical system, which is more capable of dealing with 4G challenges. Simulation results demonstrate that Tramcar increases user satisfaction levels and network throughput under rough network conditions and reduces overall handoff latencies.
Optimization of Al/a-SiC: H optical sensor device by means of thermal annealing
Authors: L. Magafas, J. Kalomiros
Venue: Microelectronics Journal (2007)

The optimization of optoelectronic properties of Al/a-SiC:H Schottky diodes grown as Al/a-SiC:H/c-Si(n) structures is studied by means of thermal annealing of a-SiC:H thin films. According to the spectral response of the Schottky diodes the measured quantum efficiency, @h"m"e"a"s"u"r"e"d, increases with increasing annealing temperature (400-600^oC), whereas @h"m"e"a"s"u"r"e"d decreases for T"a>600^oC. For T"a=600^oC, optimum material quality of a-SiC:H films is achieved and the spectral response of the Al/a-SiC:H/c-S(n) structures present very high and almost constant values (@h"m"e"a"s"u"r"e"d>=80%) for the whole range of wavelengths from 500 up to 850nm. These results show that our Al/a-SiC:H/c-S(n) structures can be very attractive as optical sensors. Diffusion length calculations as well as the mobility by lifetime product (@m@t)"p of the minority carriers (holes) of a-SiC:H films present a dependence on T"a similar to that of the measured quantum efficiency. Finally, the quantum efficiency of films processed with T"a=675^oC is found to increase when the Al/a-SiC:H/c-S(n) structures are exposed to hydrogen, a result that could be promising for the construction of a hydrogen detection sensor.
ODDM: A framework for modelbases
Authors: Thadthong Bhrammanee, Vilas Wuwongse
Venue: Decision Support Systems (2008)

The Web extends today's modelbases-an important DSS component-by enabling their sharing and reusing over the information network. A modelbase with a formal, precise, and expressive framework will enhance the interoperation and benefit machine-human as well as machine-machine interactions. Therefore, this paper proposes a Web-based-compatible framework for modelbases, namely ODDM. ''Model Ontology'' and ''Model Schema'' are main components of the framework. Both components seamlessly interoperate by means of OWL Declarative Description (ODD). The classification of existing modelbase frameworks is presented. Requirements for the framework are identified and the proposed framework's conformance to the requirements is also discussed.
Preliminary Research of Evolvable Sensor
Authors: Jinchuang Zhao, Xuekun Song, Wenli Fu, Jingjie Lei
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 05 (2007)

In order to overcome the restrictions of conventional sensors, and get the mechanisms of smart sensing and self-adapting to ambient conditions, a framework of evolvable sensor is proposed based on the combining of the characteristics of conventional sensor and evolvable hardware. The paper introduces the preliminary research of evolvable sensor which has the capacity of self-adaptation and fault-tolerance based on the evolutionary algorithm and evolvable hardware. It is a kind of real intelligent sensor.
SIMPPL: an adaptable SoC framework using a programmable controller IP interface to facilitate design reuse
Authors: Lesley Shannon, Paul Chow
Venue: IEEE Transactions on Very Large Scale Integration (VLSI) Systems (2007)

As the complexity of designing system-on-chips increases, so does the need to abstract low-level design issues to improve designer productivity. The reuse of previously designed Intellectual Property (IP) modules is a common form of abstraction used to reduce design time. However, different applications typically use a variety of physical interfaces, communication protocols, and global system-level control for IP modules, which complicates design reuse. In this paper, we describe the SIMPPL system model and an abstraction for IP modules, called the computing element (CE), that facilitate the SoC design for both field-programmable gate array (FPGA) and application-specific integrated circuit (ASIC) platforms. The CE abstraction decouples the datapath and system-level communication from the application-specific control to promote design reuse by localizing control redesign of IP for new applications. The SIMPPL model facilitates multi-clock domain SoC designs and expedites system integration by defining the intermodule links and communication protocols.
Containing the Ultimate Trojan Horse
Authors: Michael Franz
Venue: IEEE Security and Privacy (2007)

Security vulnerabilities in software systems are a rapidly growing threat in an increasingly networked world. Unfortunately, many systems are now so complex that high-assurance auditing for errors would be prohibitively expensive. This article shows how some of the potential risks could be contained through security management at the base of the software stack, rather than inside application programs.
Overview and semantic issues of text mining
Authors: Anna Stavrianou, Periklis Andritsos, Nicolas Nicoloyannis
Venue: ACM SIGMOD Record (2007)

Text mining refers to the discovery of previously unknown knowledge that can be found in text collections. In recent years, the text mining field has received great attention due to the abundance of textual data. A researcher in this area is requested to cope with issues originating from the natural language particularities. This survey discusses such semantic issues along with the approaches and methodologies proposed in the existing literature. It covers syntactic matters, tokenization concerns and it focuses on the different text representation techniques, categorisation tasks and similarity measures suggested.
Enhancing the Knowledge Management Support within the E-Learning Platforms
Authors: Mihaela Brut
Venue: Proceedings of the 18th International Conference on Database and Expert Systems Applications (2007)

In this paper we discuss and propose certain opportunities provided by the Semantic Web technologies in the view of improving the learning content management. In order to express each metadata in the most appropriate metadata standard format, there could be integrated the general metadata standards elements and properties into e-learning standards (by replacing the existing elements or by being added to), and also use some appropriate high-level ontologies and domain ontologies in order to annotate the concepts inside the Learning Objects. A good learning content management involves its correlation with the concrete students need and for this reason it implies also a good user profile management and a strong user community support.
An Enhanced Marketable Quality and Profitability Model for Network Service Pricing: Some Numerical Analysis
Authors: Valbona Barolli, Heihachiro Fukuda, Leonard Barolli, Makoto Takizawa
Venue: Proceedings of the 2007 International Conference on Parallel Processing Workshops (2007)

In this paper, we provide an evaluation model for marketable quality and profitability. We define the marketable quality as a qualitative aspect of profitability. We apply the real values of some leading manufacturing corporations in Japan to our proposed model to analyze its accuracy. From the analysis, we found that theoretical and real standard values of the marketable quality indicator were both 0.6. This shows that the proposed model has a good approximation. From the fair relation of network service providers and consumers, we present the network pricing guidelines for the maximum profitability while enhancing the marketable quality. Also, we enhance our proposed network service pricing model considering network externalities and provide some numerical analysis.
Spectral splitting method for nonlinear Schrödinger equations with singular potential
Authors: Andrea Sacchetti
Venue: Journal of Computational Physics (2007)

We consider the time-dependent one-dimensional nonlinear Schrodinger equation with pointwise singular potential. By means of spectral splitting methods we prove that the evolution operator is approximated by the Lie evolution operator, where the kernel of the Lie evolution operator is explicitly written. This result yields a numerical procedure which is much less computationally expensive than multi-grid methods previously used. Furthermore, we apply the Lie approximation in order to make some numerical experiments concerning the splitting of a soliton, interaction among solitons and blow-up phenomenon.
Noise enhancement of signal transduction by parallel arrays of nonlinear neurons with threshold and saturation
Authors: Solenna Blanchard, David Rousseau, François Chapeau-Blondeau
Venue: Neurocomputing (2007)

A classic model neuron with threshold and saturation is used to form parallel uncoupled neuronal arrays in charge of the transduction of a periodic or aperiodic noisy input signal. The impact on the transduction efficacy of added noises is investigated. In isolated neurons, improvement by noise is possible only in the subthreshold and in the strongly saturating regimes of the neuronal response. In arrays, improvement by noise is always reinforced, and it becomes possible in all regimes of operation, i.e. in the threshold, in the saturation, and also in the intermediate curvilinear part of the neuronal response. All the configurations of improvement by noise apply equally to periodic and to aperiodic signals. These results extend the possible forms of stochastic resonance or improvement by noise accessible in neuronal systems for the processing of information.