Miracle-dz/UniFAR-FTUs huggingface dataset:
Compressed Sensing Based Neural Signal Processing and Performance Analysis

Measurement of neural signal provides important value for study of brain function and the pathogenesis of neurological. With emerging extensive research of electrical activity, more and more neural signal need to be collected, transmitted and stored, making the compression processing of neural signal become important part of digital signal processing. In recent years, ASIC-based wireless neural signal acquisition system has been developed rapidly, encountered strict restrictions on power consumption which is dominant determined by the data rate and complexity of algorithm. In order to reduce power consumption, lower data rate and algorithm with lower complexity needed to be selected when design a neural acquisition system. This paper focus on neural signal compression method based on compressed sensing and its performance and compare it with conventional compression algorithm. We compare complexity of various algorithms in the view of circuit complement, show that the complexity of neural signal compression can be dramatically reduced by using specially designed compressed sensing matrix, thereby reducing the system power consumption.
Personalization of information delivery based on web mining and DNA classification

It is hard to find any kind of media with a growth-rate as high as the World Wide Web. At the same time, it is hard to find one that stores within itself such an amount of metadata, useful for an in-depth study. It is wrong to look at the WWW simply as a kind of information store. Although all its contents are information one way or the other, the truth is there are quite a few ways of letting the users interact with that information, either to manipulate it (via ajax-based applications), to alter it (through the use of wikis), to add to it (via blogs and web sites themselves) or to transform and amplify its meanings. These are only a few examples of what can be done today. Web site access logs are the main information source on how the WWW is used. Rather than asking the users if they viewed the pages (such as a TV station might do), any web site has the means to keep a permanent record about its visitors. By analyzing these logs, we are able to get a better understanding of the roles played by the web site. In this paper we borrow a few concepts from biology, in order to establish a kind of ‘DNA’ for each document on the web site of the Portuguese Tribunal de Contas (Court of Auditors). We do this by looking at the WWW as an information source and by processing what we find. At the same time, we try to extend the same approach to the users who looked for those documents, by processing the web access logs. The results of such an approach might enable future uses of automatic document classification, as well as an effective personalization of information delivery.
System-level Buffer Allocation for Application Specific Network-on-chip with Wormhole Routing

Abstract A novel buffer allocation algorithm that can be used to customize the router design in application-specific Network-on-Chip (NoC) is proposed. More precisely, according to the target application and the total budget of the available buffer resources, the proposed method automatically assigns the buffer size for each input port in different routers across the NoC, such that the overall performance is maximized. Indeed, the experimental results show that while the proposed method in this paper is used, significant performance improvements can be achieved compared to the state-the-of-art buffer allocation methods. It also allows our NoC to achieve the same performance level as the NoC which assigns buffer resources by using the state-of-art buffer allocation methods but using fewer buffer resources.
Colloidal quantum dot materials and devices: a quarter-century of advances

Colloidal quantum dots (CQDs) are nanometer-sized semiconductor particles synthesized and suspended in the solution phase. In the last several decades, they have attracted considerable attention as an important new class of materials. Evergrowing interest in these materials derives from the convenient fabrication of solids directly from the solution-phase, as well as their rationally-engineered, wide-ranging spectral tunability afforded by the quantum size effect. [ 1,2 ] With unique physical and electronic properties that evolve from individual nanocrystals to packed nanocrystal fi lms, CQDs provide a rich platform for exploring new physical phenomena, as well as in rapid development of a wide variety of novel emerging technologies, such as thin fi lm photovoltaics, lighting solutions, and sensitive photodetectors. CQDs offer benefi ts in their solution processing, the use of inexpensive materials, and their unique chemical and physical properties that enable tunable functionality. In fact, commercialization efforts are underway for photodetection and implementation in light emission. The challenges of potential toxicity and long term stability are increasingly overcome through development of non-toxic materials [ 3,4 ] and using atomic layer deposition to introduce an encapsulating matrix within solid state fi lms used in devices, [ 5 ] respectively. When the CQD size approaches the Bohr exciton radius characteristic of excitations within the corresponding bulk semiconductor, the exciton feels the effect of its fi nite-sized container. The wavelike properties of this bound electron-hole pair can no longer be neglected – as they typically are in bulk materials – and the optical and electronic properties of the CQDs can be tuned through particle size. CQDs’ small size also enables them to be manipulated in solution, since the particles can be induced to form a stable colloid in suitable solvents with the aid of bound, passivating organic molecules or ligands. This facilitates a range of solution-based materials processing methods, including spin-coating, inkjet printing, and roll-to-roll casting. These processing techniques can be lower in cost, and more amenable to large-area processing, than typical vacuum-based processes employed in more traditional semiconductor materials processing. The past few decades have witnessed an exponential growth of activity in the CQD research fi eld worldwide. This has been driven both by the exciting challenge of understanding the new science that explains their structure-composition-property relationships with potential for applications, and the resultant commercial and societal impacts. In this Review, we present historical highlights and major milestones in the fi eld of CQDs, touching on their synthesis, assembly, optical and electronic properties, materials processing, and optoelectronic and photovoltaic applications.
Improving Instructional Simulation With Structural Debriefing

Background. Research shows that learning and task performance improve when participants in management exercises understand the structure of the system they control. However, the majority of business simulators are black-boxes. Aim. This article introduces structural debriefing, which is a debriefing activity aimed at helping students learn about causal relationships, feedbacks, accumulations, and delays within a black-box simulation. Method. A structural debriefing can be prepared and facilitated by following the Structural Debriefing Protocol. Results. A pilot study was conducted in which undergraduate students participated in a structural debriefing of The LITTLEFIELD TECHNOLOGIES, a popular simulation for teaching principles of operations management. The students were able to complete all eight steps of a structural debriefing, but required considerable time (three academic terms) to do so. Not every instructional simulation will require all the steps or such a large time commitment. Conclusion. The successful completion of the pilot study demonstrates that structural debriefing is a useful debriefing technique. However, to be effective, the scope and format of a structural debriefing activity must suit practical and pedagogical considerations.
A hierarchical Weibull Bayesian model for series and parallel systems

In this paper we present a hierarchical Bayesian approach to the estimation of component's reliability in a series and parallel systems using the Weibull model. The reliability problem of a series system is similar to the survival problem of right-censored data, while the parallel system is related to left-censored data. We used the Weibull model for the reliability time and a gamma distribution for first level on hierarchy for both, scale and shape, parameters of the model. The estimation is done using Monte Carlo Markov Chain tools and Expectation-Maximization algorithm. To exemplify the efficiency of the model we presented an study with simulated data.
Bandwidth and power efficiencies of trellis coded modulation schemes

We discuss and compare advances in bandwidth efficient coding and signalling techniques, especially trellis-coded modulation (TCM). We consider power efficient TCM schemes, such as Ungerbock TCM, correlative trellis-coded modulation (C-TCM), which is optimized with respect to bandwidth efficiency, and coded overlapped quadrature modulation, which uses overlapping pulses. The bandwidth/power tradeoff of these schemes is presented, thereby illuminating the different design philosophies. <<ETX>>
A Structured Global Index Identifier Definition for Constructing Manageable, Operable and Scalable P2P Networks

P2P technology is potentially one of the cornerstones of future networks. But the absence of standards makes it difficult to operate and control P2P-based networks. In the paper, we defined a structured global index as the basis for constructing future manageable, operable and scalable networks, and try to find a way to solve the inherent problems of current P2P networks, such as interaction in heterogeneous networks and multi-dimensional query issues. In the beginning of the paper, we give an introduction on current P2P networks and summarize the problems; and then we will describe the structured global index in detail; finally, we give a prospect on future operation network, and through two cases to illustrate how the problems are solved.
Efficient Allocation of Distributed Object-Oriented Tasks To A Pre-Defined Scheduled System

Abstract A key phase in the design process of software for distributed systems is the allocation of the software components to the available hardware. A problem arises when a software/hardware mismatch occurs. This paper presents a solution to that problem by introducing a technique that guarantees efficient allocation of predefined scheduled object-oriented software components to the available hardware based on genetic algorithm. The allocation is to be made dynamically in a system with a predefined schedule. We thus modified the parameters of the genetic search technique to allow converging to the best solution in a relatively short time to be suitable for the dynamicity of the allocation. The performance of the allocation technique is evaluated in terms of the time cost (CPU clock pulses for more generality) required for the GA search to converge to the optimal allocation structure of the software components. The results obtained by the proposed technique are compared against the results from the branch-and-bound search technique. The experimental results indicate the effectiveness of the proposed technique in reaching the optimal allocation in considerable time, showing that it requires much less time than branch-and-bound.
Extraction of texture features with a multiresolution neural network

Texture is an important surface characteristic. Many industrial materials such as wood, textile, or paper are best characterized by their texture. Detection of defaults occurring on such materials or classification for quality control anD matching can be carried out through careful texture analysis. A system for the classification of pieces of wood used in the furniture industry is proposed. This paper is concerned with a neural network implementation of the features extraction and classification components of the proposed system. Texture appears differently depending at which spatial scale it is observed. A complete description of a texture thus implies an analysis at several spatial scales. We propose a compact pyramidal representation of the input image for multiresolution analysis. The feature extraction system is implemented on a multilayer artificial neural network. Each level of the pyramid, which is a representation of the input image at a given spatial resolution scale, is mapped into a layer of the neural network. A full resolution texture image is input at the base of the pyramid and a representation of the texture image at multiple resolutions is generated by the feedforward pyramid structure of the neural network. The receptive field of each neuron at a given pyramid level is preprogrammed as a discrete Gaussian low-pass filter. Meaningful characteristics of the textured image must be extracted if a good resolving power of the classifier must be achieved. Local dominant orientation is the principal feature which is extracted from the textured image. Local edge orientation is computed with a Sobel mask at four orientation angles (multiple of (pi) /4). The resulting intrinsic image, that is, the local dominant orientation image, is fed to the texture classification neural network. The classification network is a three-layer feedforward back-propagation neural network.
The Internet in India: An update

The Internet has existed in India for about 18 months. An attempt has been made here to give information about India's Internet service providers and information infrastructure, and to group the Internet information sources originating from India into various categories: viz. art, business, campus wide information systems, companies and organisations, data and software, directories, discussion lists/forums, electronic journals, e‐mail based infoservers, entertainment, investment, medical, multimedia, multipurpose, online information, religion and tourism. The paper also discusses the Internet in the social and commercial context of India and concludes with India's rapid response in providing its resources over the Net to establish its presence, the growth of Web sites, privatisation of access, and PC penetration in the SOHO and home segment.
Internationalization of the Handle System - A Persistent Global Name Service

The Handle System is a distributed computer system developed at the Corporation for National Research Initiatives (CNRI). The Handle System provides globally unique, persistent naming and name resolution service over the Internet. This paper gives a brief description of the Handle System, and further discusses internationalization issues involved in designing such a system, specifically the encoding issues of the global namespace to ensure global uniqueness, global readability, and global transcribability. The paper separates the current major practices of character set encoding and their practical use in the Handle System into three categories, namely, the limited character set approach, the use of encoding tags, and the Unicode based encoding. It concludes that, for any global name service to achieve global acceptance, every native alphabet has to be supported. Unicode based UTF-8 encoding is the recommended approach, mainly because it allows recognizable names to be defined in terms of any native language alphabet, including, but not limited to English or western European languages. Further, the paper provides details on how handles are defined within the Handle System using the UTF-8 encoding, as well as how handles can be used in the World Wide Web environment using current browser technology. 1. The Handle System The Handle System [1] is a comprehensive service for assigning, managing, and resolving persistent names or identifiers, known as "Handles", for network resources. Each handle defined in the Handle System is globally unique, and can be used as a persistent reference to any resource over the Internet. (Note that in this document we do not attempt to distinguish between the term 'name' and 'identifier' and will use them interchangeably.) The Handle System provides (a) an open set of protocols for a distributed computer system [2,3], so that handles can be stored and resolved into their corresponding digital resources in a unambiguous manner; (b) a global name space, which allows network resources to be named in terms of any native alphabet; and (c), an implementation of the distributed global name service based on the handle protocols. The service provides a persistent global naming service, based on a centrally administered naming authority registration service, and a global name resolution service integrated with popular web browsers. Handles defined in the Handle System are readily accessible by any application over the Internet via the Handle Resolution protocol [2]. In particular, handles can be resolved from popular web browsers using the Handle System Resolver [4], Handle System Proxy Service, and in the future, the URN (Uniform Resource Names) services defined by the IETF URN working group [5,6]. The Handle System is designed to conform to all the fundamental requirements as outlined in the URN/URI specifications [6,7]. Specifically, the Handle System was designed to address the following issues in network resource identification:
The Key Technologies for Classification of Distributed Data Streams

With advances in data collection and generation technologies, environments that produce data streams is more and more. In recent years, the network application is further universal and the applications of a single data stream transfer toward a multi-node distributed data streams, such as sensor network, network monitoring, web log analysis and the credit card transaction data of multiple sites. These data is not only real-time, continuous and large scale, but also distributed. How to manage and analyze large dynamic datasets is an important subject that researchers are faced with. In view of the situation, it presented the formalization description of homogeneous and heterogeneous distributed data stream in this paper, analyzed advantages and disadvantages of the centralized stream processing architecture and distributed streaming processing architecture, discussed the recent progress in distributed data stream classification algorithm, summed up the problems and challenges faced by the distributed data stream mining, and possible future research directions.
A Membrane-Bound Cytochrome c 3 : A Type II Cytochrome c 3 from Desulfovibrio vulgaris Hildenborough

A new tetraheme cytochrome c3 was isolated from the membranes of Desulfovibrio vulgaris Hildenborough (DvH). This cytochrome has a molecular mass of 13.4 kDa and a pI of 5.5 and contains four heme c groups with apparent reduction potentials of ˇ 170 mV, ˇ 235 mV, ˇ 260 mV and ˇ 325 mV at pH 7.6. The complete sequence of the new cytochrome, retrieved from the preliminary data of the DvH genome, shows that this cytochrome is homologous to the “acidic” cytochrome c3 from Desulfovibrio africanus (Da). A model for the structure of the DvH cytochrome was built based on the structure of the Da cytochrome. Both cytochromes share structural features that distinguish them from other cytochrome c3 proteins, such as a solvent-exposed heme 1 surrounded by an acidic surface area, and a heme 4 which lacks most of the surface lysine patch proposed to be the site of hydrogenase interaction in other cytochrome c3 proteins. Furthermore, in contrast to previously discovered cytochrome c3 proteins, the genes coding for these two cytochromes are adjacent to genes coding for two membrane-associated FeS proteins, which indicates that they may be part of membrane-bound oxidoreductase complexes. Altogether these observations suggest that the DvH and Da cytochromes are a new type of cytochrome c3 proteins (Type II : TpII-c3) with different redox partners and physiological function than the other cytochrome c3 proteins (Type I : TpI-c3). The DvH TpII-c3 is reduced at considerable rates by the two membranebound [NiFe] and [NiFeSe] hydrogenases, but catalytic amounts of TpI-c3 increase these rates two- and fourfold, respectively. With the periplasmic [Fe] hydrogenase TpII-c3 is reduced much slower than TpI-c3 , and no catalytic effect of TpI-c3 is observed.
Performance modelling with the Unified Modelling Language and stochastic process algebras

A software toolset which allows unified modelling language (UML) modellers to annotate models with performance information is described. An equivalent performance model is extracted from the UML, solved, and the results reflected back to the UML level. Used in this way, the toolset gives a high-level approach to software performance modelling where the benefits of the performance modelling process are achieved without significant additional notational burden.
Modelling Peterson Mutual Exclusion Algorithm in DVE Language and Verifying LTL Properties

Peterson mutual exclusion algorithm is a concurrent programming algorithm for mutual exclusion that allows two processes to share a single-use resource without conflict, using only shared memory for communication. DiVinE is a LTL model checker, and DVE is the specification language. In this paper, we implement the DVE model of Peterson mutual exclusion algorithm, and verify LTL properties of Peterson mutual exclusion algorithms using DiVinE model checker. The experimental results show that the LTL formula structure is relevant to the costs of LTL verification.
In Memoriam: RAYMOND REITER June 12, 1939 – September 16, 2002

Raymond Reiter, Professor of computer science at the University of Toronto, a Fellow of the Royal Society of Canada, and winner of the 1993 – IJCAI Outstanding Research Scientist Award, died September 16, 2002, after a year-long struggle with cancer. Reiter, known throughout the world as “Ray,” made foundational contributions to artificial intelligence, knowledge representation and databases, and theorem proving.
Non-Preemptive Access to Shared Resources in Hierarchical Real-Time Systems ⁄

This paper presents a new strategy to arbitrate the access to globally shared resources in hierarchical EDF scheduled real-time systems, without needing any information on the duration of each critical section. Previous works addressing this problem assumed each task worst-case critical section length be known in advance. However, this assumption is valid only in restricted system domains, and is definitely inadequate for general purpose real-time operating systems. To sidestep this problem, we will instead measure at run-time the amount of time for which a task keeps a resource locked, assuring that there is enough bandwidth to tolerate the interferences associated to such measured blocking times. The protocol will execute each critical section non-preemptively, exploiting a previously proposed server that performs a budget check before each locking operation. Two methods with different complexities will be derived to compute upper-bounds on the maximum time for which a critical section may be executed non-preemptively in a given hierarchical system.