AI Content Generation Tools — independent reviews, comparisons, pricing and step-by-step guides on Aizhi.
Semantic interpretation is an important component in dialog systems. It is related to natural language understanding, but mostly it refers to the last stage of understanding. The goal of interpretation is binding the user utterance to concept, or something the system can understand. Typically it is creating a database query based on user utterance.
Read more →
Electric Literature is an American literary magazine. == History == Founded by Andy Hunter and Scott Lindenbaum in 2009 as a print quarterly journal, Electric Literature transitioned to a daily website in 2012 under the helm of Halimah Marcus and Benjamin Samuel. Electric Literature publishes essays, reading lists, interviews, fiction, poetry, graphic narratives, humor, and book news, all available to read online for free without a paywall. It launched the first fiction magazine on the iPhone and iPad. Work published has been recognized by Best American Short Stories, Essays, Poetry, and Comics, the Pushcart Prize, Best Canadian Short Stories, The Best of the Small Presses, and the O. Henry Prize. in 2014, Electric Literature became a registered non-profit. In 2016, Halimah Marcus was appointed the first executive director of Electric Literature. She has been with the magazine since 2010. In 2021, Denne Michele Norris became editor-in-chief of Electric Literature, the first Black and openly trans editor-in-chief of a major U.S. literary publication. In 2022, Electric Literature was the Digital Prize Winner of the Whiting Literary Magazine Prizes. In 2023, Electric Literature partnered with Banned Books USA to offer free banned and challenged books to residents of Florida. In 2025, Electric Literature published their first book, edited by Norris and published by HarperOne: Both/And: Essays by Trans and Gender-Nonconforming Writers of Color. It builds on a prior essay series that Electric Literature sponsored for trans writers of color. Both/And became a finalist for the 2026 Lambda Literary Award for Transgender Nonfiction. == Recommended reading == In May 2012, Electric Literature launched Recommended Reading, a weekly fiction magazine. Each issue is curated by a well known editor or writer. == The Commuter == The Commuter, a weekly magazine for poetry, flash, graphic, or experimental narrative, debuted in January 2018, helmed by writer Kelly Luce.
Read more →
DBOS (Formerly Database-Oriented Operating System, now just DBOS) is an open source durable workflow execution software library written for the Python, TypeScript, Java, and Go programming languages. DBOS arose from a joint open source project from MIT and Stanford, after a discussion between Michael Stonebraker and Matei Zaharia on how to scale and improve scheduling and performance of millions of Apache Spark tasks. Today it is a commercial company that offers an open source system to add durable computing to any software, built on concepts derived from the joint research project. == History == === 2020: Academic R&D Project === DBOS originated in 2020 as a joint open source project between MIT, Stanford, and Carnegie Mellon. The project explored the idea of operating system services built atop a distributed database - a database-oriented operating system meant to simplify and improve the scalability, security and resilience of large-scale distributed applications. The basic concept was to run a multi-node multi-core, transactional, highly-available distributed database, such as VoltDB, as the only application for a microkernel, and then to implement scheduling, messaging, file systems and other operating system services on top of the database. The architectural philosophy is described by this quote from the abstract of their initial preprint: All operating system state should be represented uniformly as database tables, and operations on this state should be made via queries from otherwise stateless tasks. This design makes it easy to scale and evolve the OS without whole-system refactoring, inspect and debug system state, upgrade components without downtime, manage decisions using machine learning, and implement sophisticated security features. A prototype was built with competitive performance to existing systems. ==
Read more →
The International Teletraffic Congress (ITC) is the first international conference in networking science and practice. It was created in 1955 by Arne Jensen to initially cater to the emerging need to understand and model traffic in telephone networks using stochastic methodologies, and to bring together researchers with these considerations as a common theme. Up through World War II, teletraffic research was done mainly by engineers and mathematicians working in telephone companies. Most of their work was published in local or company journals. In 1955, however, the field acquired a formal, international, institutional structure, with the organization of the first International Teletraffic Congress (ITC). Over the years, it has broaden its scope to address a wide spectrum ranging from the mathematical theory of traffic processes, stochastic system modelling and analysis, traffic and performance measurements, network management, traffic engineering to network capacity planning and cost optimization, including network economics and reliability for various types of networks. ITC served as a forum for all theoretical fundamentals and engineering practices for large-scale deployment and operation of telecommunications networks. Since its inception, ITC witnessed the evolution of communications and networking: the influence of computer science on telecommunication, the advent of the Internet and the massive deployment of mobile communications and optics, the appearance of peer-to-peer networking and social networks, the ever increasing speed and flexibility of new communication technologies, networks, user devices, and applications, and the ever changing operation challenges arising from this development. ITC documented this evolution with contemporary measurement studies, performance analyses of new technologies, recommendations for provisioning and configuration, and greatly contributed to the methodological toolbox of network scientists. Today, with its conferences, specialist seminars, regional seminars, training courses and publications, the ITC aims at a worldwide forum for all questions related to network and service performance, management, and assessment, both present and futuristic. The notion of traffic is broadly used to encompass data traffic from the MAC layer all the way to application traffic in the application layer. The scope of ITC is thus ranging all issues embedding operations, design, planning, economics and performance analysis of current and emerging communication networks and services, to be addressed by applying a variety of tools from different fields, such as Stochastic Processes, Information theory, Control theory, Signal and Processing, Game theory and optimization techniques, Statistical methodologies and Artificial Intelligence techniques. The target audience of such issues is experts from research organizations, universities, equipment vendors and suppliers, network operators, service providers, system integrators and international technical organizations, guaranteeing a well-balanced contribution from theory, application, and practice. The general goal remains to bring researchers and practitioners together toward operational understanding of all types of current and future networks. The ITC is ruled by the International Advisory Council (IAC) which gathers a number of technical experts, from universities and the research arms of key corporations in the industry, from countries having a strong tradition in teletraffic development. The IAC responsibilities are to disseminate information on teletraffic which is of interest for the whole community and: to select the locations of Plenary Congresses and to ensure their high-level technical programme to support Specialist Seminars on specific topics of current interest to promote Regional Seminars for the dissemination of teletraffic concepts in developing countries to facilitate the liaison activity with the ITU through participation in the standardization process and in the Development Programme The technical program and the organization of each ITC event remains within the responsibilities of the hosting country, but with significant IAC support to guarantee that the event is consistent with the quality standards established during the previous congresses. The ITC Plenary Congresses were scheduled tri-annually from 1955 until 1995 when the interval became bi-annual to account for the ever-accelerating development of network technologies, products and services and the associated dramatic increases in network demands. Similarly, to better cover the impact of dramatic changes undergoing in the field of computer and communication systems, networks and usage, it has been decided to hold the Plenary Congress on an annual basis from 2009. == Content == Teletraffic science is the traditional term for all theoretical fundamentals and engineering practices to describe data flows in telecommunication networks, the performance of the usage of network resources, procedures for sizing of resources and engineering the networks for given traffic load and quality of service requirements. For more than 50 years of the 20th century, traffic or teletraffic has been identified primarily with telephone networks. With the huge development of computers, stored program control of network nodes and computer communication, the traditional teletraffic science field naturally extended to computer networks, mobile and wireless/optical networks, and for a wide spectrum of new applications. The convergence between the voice network, the Internet, the television and mobility raised new questions that request new models and tools to be developed. In addition, the development of community networks, home networking, multiple access networking technologies, and the advent of pervasive and ambient communications dictates new challenges to be addressed. Today, ITC addresses the emerging paradigms such as an increasing diversity of distributed applications and services over various media like mobile/optical networks, enabling new markets and economy. ITC has steered the evolutions in communications since its creation in 1955 and remains at the forefront of innovation regarding modeling and performance. The scientific roots of communications traffic are based on the theory of probability and stochastic processes, modelling and performance evaluation. Modelling is the key for the mathematical description and quantitative performance analysis. Traffic flows are described by stochastic processes with complex dependencies which have to be validated by traffic measurements. Modelling also includes operational properties of resource control reflected by service strategies such as queueing disciplines, admission control, and routing. The results of such performance analyses are used for resource dimensioning (sizing), resource management, and network optimization while providing targeted Quality of Service. Teletraffic science is closely related to methods of operation research (queueing theory, optimization, forecasting) and computational sciences (simulation technology distributed systems). In this context, ITC represents a wide community of researchers and practitioners and is regularly organizing events like Congresses, Specialist Seminars and Workshops in order to discuss the latest changes in the modelling, design and performance of communication systems, networks and services. === The evolution of technologies of the 20th century === ITC has been witnessing the change of communication and networking technologies which are reflected in the proceedings and programs of the congresses. The specialist seminars and the motto of the congresses thereby reflect the hot topics of that time and the evolution. Selected topics of the 70's, 80's and 90's were 1998: Traffic Issues related to Multimedia and Nomadic Communications 1995: Traffic Modeling and Measurement in Broadband and Mobile Communications 1990: Broadband Technologies: Architectures, Applications, Control and Performance 1986: ISDN Traffic Issues 1984: Fundamentals of Teletraffic Theory 1977: Modeling of SPC Exchanges and Data Networks === Recent topics in the 21st century === With the rise of the Internet, new networking paradigms and technologies but also new challenges emerged: 2020: Teletraffic in the era of beyond-5G and AI 2019: Networked Systems and Services 2018: Teletraffic in the Smart World 2017: Ubiquitous, software-based, and sustainable networks and services 2016: Digital Connected World 2015: Traffic, Performance and Big Data 2014: Towards a Sustainable World 2013: Energy Efficient and Green Networking 2010: Multimedia Applications - Traffic, Performance and QoE 2009: Network Virtualization - Concepts and Performance 2008: Future Internet Design and Experimental Facilities 2008: Quality of Experience 2002: Internet Traffic Engineering and Traffic Management == Arne Jensen Lifetime Achievement Awards == The Arne Jensen Lifetime A
Read more →
The (Google/Apple) Exposure Notification System (GAEN) is a framework and protocol specification developed by Apple Inc. and Google to facilitate digital contact tracing during the COVID-19 pandemic. When used by health authorities, it augments more traditional contact tracing techniques by automatically logging close approaches among notification system users using Android or iOS smartphones. Exposure Notification is a decentralized reporting protocol built on a combination of Bluetooth Low Energy technology and privacy-preserving cryptography. It is an opt-in feature within COVID-19 apps developed and published by authorized health authorities. Unveiled on April 10, 2020, it was made available on iOS on May 20, 2020, as part of the iOS 13.5 update and on December 14, 2020, as part of the iOS 12.5 update for older iPhones. On Android, it was added to devices via a Google Play Services update, supporting all versions since Android Marshmallow. The Apple/Google protocol is similar to the Decentralized Privacy-Preserving Proximity Tracing (DP-3T) protocol created by the European DP-3T consortium and the Temporary Contact Number (TCN) protocol by Covid Watch, but is implemented at the operating system level, which allows for more efficient operation as a background process. Since May 2020, a variant of the DP-3T protocol is supported by the Exposure Notification Interface. Other protocols are constrained in operation because they are not privileged over normal apps. This leads to issues, particularly on iOS devices where digital contact tracing apps running in the background experience significantly degraded performance. The joint approach is also designed to maintain interoperability between Android and iOS devices, which constitute nearly all of the market. The ACLU stated the approach "appears to mitigate the worst privacy and centralization risks, but there is still room for improvement". In late April, Google and Apple shifted the emphasis of the naming of the system, describing it as an "exposure notification service", rather than "contact tracing" system. == Technical specification == Digital contact tracing protocols typically have two major responsibilities: encounter logging and infection reporting. Exposure Notification only involves encounter logging which is a decentralized architecture. The majority of infection reporting is centralized in individual app implementations. To handle encounter logging, the system uses Bluetooth Low Energy to send tracking messages to nearby devices running the protocol to discover encounters with other people. The tracking messages contain unique identifiers that are encrypted with a secret daily key held by the sending device. These identifiers change every 15–20 minutes as well as Bluetooth MAC address in order to prevent tracking of clients by malicious third parties through observing static identifiers over time. The sender's daily encryption keys are generated using a random number generator. Devices record received messages, retaining them locally for 14 days. If a user tests positive for infection, the last 14 days of their daily encryption keys can be uploaded to a central server, where it is then broadcast to all devices on the network. The method through which daily encryption keys are transmitted to the central server and broadcast is defined by individual app developers. The Google-developed reference implementation calls for a health official to request a one-time verification code (VC) from a verification server, which the user enters into the encounter logging app. This causes the app to obtain a cryptographically signed certificate, which is used to authorize the submission of keys to the central reporting server. The received keys are then provided to the protocol, where each client individually searches for matches in their local encounter history. If a match meeting certain risk parameters is found, the app notifies the user of potential exposure to the infection. Google and Apple intend to use the received signal strength (RSSI) of the beacon messages as a source to infer proximity. RSSI and other signal metadata will also be encrypted to resist deanonymization attacks. === Version 1.0 === To generate encounter identifiers, first a persistent 32-byte private Tracing Key ( t k {\displaystyle tk} ) is generated by a client. From this a 16 byte Daily Tracing Key is derived using the algorithm d t k i = H K D F ( t k , N U L L , 'CT-DTK' | | D i , 16 ) {\displaystyle dtk_{i}=HKDF(tk,NULL,{\text{'CT-DTK'}}||D_{i},16)} , where H K D F ( Key, Salt, Data, OutputLength ) {\displaystyle HKDF({\text{Key, Salt, Data, OutputLength}})} is a HKDF function using SHA-256, and D i {\displaystyle D_{i}} is the day number for the 24-hour window the broadcast is in starting from Unix Epoch Time. These generated keys are later sent to the central reporting server should a user become infected. From the daily tracing key a 16-byte temporary Rolling Proximity Identifier is generated every 10 minutes with the algorithm R P I i , j = Truncate ( H M A C ( d t k i , 'CT-RPI' | | T I N j ) , 16 ) {\displaystyle RPI_{i,j}={\text{Truncate}}(HMAC(dtk_{i},{\text{'CT-RPI'}}||TIN_{j}),16)} , where H M A C ( Key, Data ) {\displaystyle HMAC({\text{Key, Data}})} is a HMAC function using SHA-256, and T I N j {\displaystyle TIN_{j}} is the time interval number, representing a unique index for every 10 minute period in a 24-hour day. The Truncate function returns the first 16 bytes of the HMAC value. When two clients come within proximity of each other they exchange and locally store the current R P I i , j {\displaystyle RPI_{i,j}} as the encounter identifier. Once a registered health authority has confirmed the infection of a user, the user's Daily Tracing Key for the past 14 days is uploaded to the central reporting server. Clients then download this report and individually recalculate every Rolling Proximity Identifier used in the report period, matching it against the user's local encounter log. If a matching entry is found, then contact has been established and the app presents a notification to the user warning them of potential infection. === Version 1.1 === Unlike version 1.0 of the protocol, version 1.1 does not use a persistent tracing key, rather every day a new random 16-byte Temporary Exposure Key ( t e k i {\displaystyle tek_{i}} ) is generated. This is analogous to the daily tracing key from version 1.0. Here i {\displaystyle i} denotes the time is discretized in 10 minute intervals starting from Unix Epoch Time. From this two 128-bit keys are calculated, the Rolling Proximity Identifier Key ( R P I K i {\displaystyle RPIK_{i}} ) and the Associated Encrypted Metadata Key ( A E M K i {\displaystyle AEMK_{i}} ). R P I K i {\displaystyle RPIK_{i}} is calculated with the algorithm R P I K i = H K D F ( t e k i , N U L L , 'EN-RPIK' , 16 ) {\displaystyle RPIK_{i}=HKDF(tek_{i},NULL,{\text{'EN-RPIK'}},16)} , and A E M K i {\displaystyle AEMK_{i}} using the algorithm A E M K i = H K D F ( t e k i , N U L L , 'EN-AEMK' , 16 ) {\displaystyle AEMK_{i}=HKDF(tek_{i},NULL,{\text{'EN-AEMK'}},16)} . From these values a temporary Rolling Proximity Identifier ( R P I i , j {\displaystyle RPI_{i,j}} ) is generated every time the BLE MAC address changes, roughly every 15–20 minutes. The following algorithm is used: R P I i , j = A E S 128 ( R P I K i , 'EN-RPI' | | 0 x 000000000000 | | E N I N j ) {\displaystyle RPI_{i,j}=AES128(RPIK_{i},{\text{'EN-RPI'}}||{\mathtt {0x000000000000}}||ENIN_{j})} , where A E S 128 ( Key, Data ) {\displaystyle AES128({\text{Key, Data}})} is an AES cryptography function with a 128-bit key, the data is one 16-byte block, j {\displaystyle j} denotes the Unix Epoch Time at the moment the roll occurs, and E N I N j {\displaystyle ENIN_{j}} is the corresponding 10-minute interval number. Next, additional Associated Encrypted Metadata is encrypted. What the metadata represents is not specified, likely to allow the later expansion of the protocol. The following algorithm is used: Associated Encrypted Metadata i , j = A E S 128 _ C T R ( A E M K i , R P I i , j , Metadata ) {\displaystyle {\text{Associated Encrypted Metadata}}_{i,j}=AES128\_CTR(AEMK_{i},RPI_{i,j},{\text{Metadata}})} , where A E S 128 _ C T R ( Key, IV, Data ) {\displaystyle AES128\_CTR({\text{Key, IV, Data}})} denotes AES encryption with a 128-bit key in CTR mode. The Rolling Proximity Identifier and the Associated Encrypted Metadata are then combined and broadcast using BLE. Clients exchange and log these payloads. Once a registered health authority has confirmed the infection of a user, the user's Temporary Exposure Keys t e k i {\displaystyle tek_{i}} and their respective interval numbers i {\displaystyle i} for the past 14 days are uploaded to the central reporting server. Clients then download this report and individually recalculate every Rolling Proximity Identifier starting from interval number i {\displaystyle i} ,
Read more →
The Morning After is a Hulu original web series that premiered on January 17, 2011, and ended April 24, 2014. It was produced by Hulu and Jace Hall's HDFilms, streaming Monday through Friday. The show originally featured Brian Kimmet and Ginger Gonzaga as hosts. Later shows used a rotation of hosts including Alison Haislip, Dave Holmes, Damien Fahey, Bradley Hasemeyer, Haley Mancini, Paul Nyhart, and Rachel Perry. The series advertises itself as "a smart, daily shot of pop culture to help Hulu users stay up to date" and typically highlights notable moments from television shows and current news in an entertaining fashion. In keeping with its focus on pop culture, The Morning After will sometimes stream an episode featuring past pop culture titled "From the Archives," such as its April Fools' Day episode. == History == While not the first original series to appear exclusively on Hulu, The Morning After is the company's first self-branded production. It was preceded by If I Can Dream, a reality series co-produced with 19 Entertainment and created by Simon Fuller. Hulu originated the idea in house, based on user feedback and observations from discussion boards hosted by the website. The concept was modeled after The Big Show with Olbermann and Patrick. The company sought out a production partner and ultimately chose Jace Hall and his team at HDFilms to executive produce. Initial stream of the series was held on January 17, 2011, and featured coverage of Piers Morgan, the Golden Globes, and The Bachelor. Senior VP of Content and Distribution Andy Forssell made the announcement for the show the same day. The show aired its last episode April 24, 2014. == Format == A typical episode usually begins with a cold open shared by the varying hosts listing the highlights to be covered. The topics focus on TV and Pop Culture Highlights from the previous night, with the intention of helping Hulu users digest hours of content in a matter of moments. The show has the hosts trade humorous remarks regarding the news and each other, taking turns reviewing the night's TV and injecting their own personality. The Morning After was named as an honoree by the Webbys on April 10, 2012, in the variety section of its online video category.
Read more →
An electronic kit is a package of electrical components used to build an electronic device. Generally, kits are composed of electronic components, a circuit diagram (schematic), assembly instructions, and often a printed circuit board (PCB) or another type of prototyping board. There are two types of kits. Some build a single device or system. Other types used for education demonstrate a range of circuits. These will include a solderless construction board of some type, such as: Components mounted in plastic blocks with side contacts, that are held together in a base, e.g. Denshi blocks Springs on a card board, the springs trap wire leads, or component leads, such as Philips EE electronic experiment kits. These are a cheap and flexible option Professional type prototyping boards, (breadboards) into which component leads are inserted, following documentation of the "kit". The first type of kit for constructing a single device normally uses a PCB on which components are soldered. They normally come with extended documentation describing which component goes where into the PCB. For advanced hobby projects, sometimes the kit may only consist of a printed circuit board and assembly instructions, and the purchaser may have to source all the parts independently; or, the vendor may provide hard-to-get or pre-programmed parts while expecting the purchaser to obtain the rest of the components. People primarily purchase electronic kits to have fun and learn how things work. They were once popular as a means to reduce the cost of buying goods, but there is usually no cost saving in buying a kit today. Some electronic kits were assembled to make complete complex devices such as color television sets, oscilloscopes, high-end audio amplifiers, amateur radio equipment, electric organs, and even computers such as the Heathkit H-8, and the LNW-80. Many of the early microprocessor computers were sold as either electronic kits or assembled and tested. Heathkit sold millions of electronic kits during its 45-year history. Home assembly of common consumer electronics items no longer provides a cost advantage over commercially manufactured and distributed devices. People still build kits for custom devices and special-purpose electronics for professional and educational use and as a hobby. Also emerging is a trend to simplify the complexity by providing preprogrammed or modular kits often provided by many suppliers online. The fun and thrill of making your own electronics have shifted, in many cases, from easy-to-comprehend applications and analog devices to more sophisticated digital devices. == Examples == The Altair 8800 (the first home computer) was also sold as a kit, as were the MK14, Sinclair ZX80, Sinclair ZX81 and Acorn Atom computers. Many S-100 bus system cards were sold only as kits. Building a Robot kit, most often with a micro controller inside, is now in fashion.
Read more →
A search appliance is a type of computer which is attached to a corporate network for the purpose of indexing the content shared across that network in a way that is similar to a web search engine. It may be made accessible through a public web interface or restricted to users of that network. A search appliance is usually made up of: a gathering component, a standardizing component, a data storage area, a search component, a user interface component, and a management interface component. == Vendors of search appliances == Fabasoft Google InfoLibrarian Search Appliance™ Maxxcat Searchdaimon Thunderstone == Former/defunct vendors of search appliances == Black Tulip Systems Google Search Appliance Index Engines Munax Perfect Search Appliance
Read more →
In machine learning and pattern recognition, a feature is an individual measurable property or characteristic of a data set. Choosing informative, discriminating, and independent features is crucial to producing effective algorithms for pattern recognition, classification, and regression tasks. Features are usually numeric, but other types such as strings and graphs are used in syntactic pattern recognition, after some pre-processing step such as one-hot encoding. The concept of "features" is related to that of explanatory variables used in statistical techniques such as linear regression. == Feature types == In feature engineering, two types of features are commonly used: numerical and categorical. Numerical features are continuous values that can be measured on a scale. Examples of numerical features include age, height, weight, and income. Numerical features can be used in machine learning algorithms directly. Categorical features are discrete values that can be grouped into categories. Examples of categorical features include gender, color, and zip code. Categorical features typically need to be converted to numerical features before they can be used in machine learning algorithms. This can be done using a variety of techniques, such as one-hot encoding, label encoding, and ordinal encoding. The type of feature that is used in feature engineering depends on the specific machine learning algorithm that is being used. Some machine learning algorithms, such as decision trees, can handle both numerical and categorical features. Other machine learning algorithms, such as linear regression, can only handle numerical features. == Classification == A numeric feature can be conveniently described by a feature vector. One way to achieve binary classification is using a linear predictor function (related to the perceptron) with a feature vector as input. The method consists of calculating the scalar product between the feature vector and a vector of weights, qualifying those observations whose result exceeds a threshold. Algorithms for classification from a feature vector include nearest neighbor classification, neural networks, and statistical techniques such as Bayesian approaches. == Examples == In character recognition, features may include histograms counting the number of black pixels along horizontal and vertical directions, number of internal holes, stroke detection and many others. In speech recognition, features for recognizing phonemes can include noise ratios, length of sounds, relative power, filter matches, logarithmic Mel-scale spectral vectors and Mel-frequency cepstral coefficients, which represent the frequency characteristics of audio signals. In spam detection algorithms, features may include the presence or absence of certain email headers, the email structure, the language, the frequency of specific terms, the grammatical correctness of the text. In computer vision, there are a large number of possible features, such as edges and objects. == Feature vectors == In pattern recognition and machine learning, a feature vector is an n-dimensional vector of numerical features that represent some object. Many algorithms in machine learning require a numerical representation of objects, since such representations facilitate processing and statistical analysis. When representing images, the feature values might correspond to the pixels of an image, while when representing texts the features might be the frequencies of occurrence of textual terms. Feature vectors are equivalent to the vectors of explanatory variables used in statistical procedures such as linear regression. Feature vectors are often combined with weights using a dot product in order to construct a linear predictor function that is used to determine a score for making a prediction. The vector space associated with these vectors is often called the feature space. In order to reduce the dimensionality of the feature space, a number of dimensionality reduction techniques can be employed. Higher-level features can be obtained from already available features and added to the feature vector; for example, for the study of diseases the feature 'Age' is useful and is defined as Age = 'Year of death' minus 'Year of birth' . This process is referred to as feature construction. Feature construction is the application of a set of constructive operators to a set of existing features resulting in construction of new features. Examples of such constructive operators include checking for the equality conditions {=, ≠}, the arithmetic operators {+,−,×, /}, the array operators {max(S), min(S), average(S)} as well as other more sophisticated operators, for example count(S, C) that counts the number of features in the feature vector S satisfying some condition C or, for example, distances to other recognition classes generalized by some accepting device. Feature construction has long been considered a powerful tool for increasing both accuracy and understanding of structure, particularly in high-dimensional problems. Applications include studies of disease and emotion recognition from speech. == Selection and extraction == The initial set of raw features can be redundant and large enough that estimation and optimization is made difficult or ineffective. Therefore, a preliminary step in many applications of machine learning and pattern recognition consists of selecting a subset of features, or constructing a new and reduced set of features to facilitate learning, and to improve generalization and interpretability. Extracting or selecting features is a combination of art and science; developing systems to do so is known as feature engineering. It requires the experimentation of multiple possibilities and the combination of automated techniques with the intuition and knowledge of the domain expert. Automating this process is feature learning, where a machine not only uses features for learning, but learns the features itself.
Read more →
A Media Block or Integrated Media Block (IMB) is a component in a digital cinema projection system. Its purpose is to convert the Digital Cinema Package (DCP) content into data that ultimately produces picture and sound in a theater in compliance with DCI anti-piracy encryption requirements. == Terminology == DCI specification allows for two different security system architectures. In the first the Media Block is outside of the projector. This design is simply referred to as a "Media Block" and is typically a device attached directly to the motherboard of a Digital Cinema server. The media block is usually connected to the projector by dual-link SDI cables. Such media block is limited to processing 2K output, downscaling 4K DCPs if necessary. The second architecture describes an "Integrated Media Block". This refers to a device attached and integrated directly into the projector, which receives image data from the server, usually via a cat6 Ethernet connection. They can process 2K and 4K output. Some hardware implementations integrate the entire server on a single board and are able to work both as a MB as well as an IMB. == Security features == All security functions are contained within a Secure Processing Block (SPB), a tamper-proof physical device. Upon ingestion into a DCP server, Key Delivery Messages (KDM) are stored on flash memory in the media block or IMB. A KDM is written to enable the playback of a specific DCP during a specific time window and on a specific media block or IMB, identified by its serial number during the authoring process. Media blocks and IMBs also contain a secure clock that is set in the factory cannot be altered by the end user, which the DCP servers to which they are attached use to determine showtimes. The secure clock prevents theaters from showing encrypted movies outside the times authorized by the KDM (e.g. after it has expired) by simply changing the date and time in the server's BIOS. Media blocks and IMBs also typically include anti-tamper devices, designed to self-destruct the unit if unauthorized modification of its hardware, software or secure clock is attempted.
Read more →
Pull coding or client pull is a style of network communication, where the initial request for data originates from the client, and then is responded to by the server. The reverse is known as push technology, where the server pushes data to clients. Pull requests form the foundation of network computing, where many clients request data from centralized servers. Pull is used extensively on the Internet for HTTP page requests from websites. A push can also be simulated using multiple pulls within a short amount of time. For example, when pulling POP3 email messages from a server, a client can make regular pull requests, every few minutes. To the user, the email then appears to be pushed, as emails appear to arrive close to real-time. A trade-off of this system is that it places a heavier load on both the server and network to function correctly. Many web feeds, such as RSS are technically pulled by the client. With RSS, the user's RSS reader polls the server periodically for new content; the server does not send information to the client unrequested. This continual polling is inefficient and has contributed to the shutdown or reduction of several popular RSS feeds that could not handle the bandwidth. For solving this problem, the WebSub protocol, as another example of a push code, was devised. Podcasting is specifically a pull technology. When a new podcast episode is published to an RSS feed, it sits on the server until it is requested by a feed reader, mobile podcasting app, or directory. Directories such as Apple Podcasts (iTunes), The Blubrry Directory, and many apps' directories request the RSS feed periodically to update the Podcast's listing on those platforms. Subscribers to those RSS feeds via app or reader will get the episodes when they request the RSS feed next time, independent of when the directory listing updates.
Read more →
Proximedia Group is a Belgian media group. == History == Proximedia Belgium was founded in 1998, by Fabrice Wuyts and Eric Glachant. The company specializes in providing websites for SMEs. The Proximedia Group SA was founded in 1999 and became the coordinating organization of Proximedia Belgium, Online, Bizbook Channel, Globule Bleu bvba, Click+, Proximedia France, Proximedia Nederland, and Proximedia Spain. The Proximedia Group has been listed at the Free Market of Euronext Brussels since 2005. In 2007, the Proximedia Group founded the Bizbook Channel. This branch specialized in creating corporate videos. In 2008, Proximedia SA took over the web agency Globule Bleu. The following year, Proximedia launched the brand BeUP. They were also elected ‘Enterprise of The Year 2009’ by Ernst & Young. Proximedia launched two new services in 2011: Videobiz and Promobook. In 2012, the Bizbook Channel was launched. Proximedia was acquired by Publicis Groupe S.A. in July 2014. == Branches == Proximedia Belgium: the oldest branch of the Proximedia Group. It makes websites and provides support for their customers. Similar branches are Proximedia France and Proximedia Nederland. Batibouw +: specialized in bringing contractors and clients together. Bizbook Channel: specialized in creating corporate videos for SMEs. Click+: offers the management of Google AdWords campaigns. This contains advertising in Google's search results. Globule Bleu: specialized in digital campaigns for larger companies or organisations. Online: an Internet Service Provider (ISP) that provides internet access, domain names, hosting of websites and data centers, email service, etc. Bizbook: an online guestbook where users can post reviews on products and services of a company. Promobook: an online service which can be used to print promotions and coupons. == Key figures == == Sale tactics and lawsuits == There are a lot of websites, forums and blogs that warn for Proximedia. This is because of the long duration of the contract, the inability to terminate the contract and the alleged aggressive approach of Proximedia and the alleged low quality of service that Proximedia offers. Also, there are a lot of lawsuits every month, some of which are customers that wish to terminate the contract, others that allege Proximedia of misguiding. List of some example lawsuits: Mitigation of contractual termination compensation on the basis of article 6:248 paragraph 2 of the Dutch Civil Code A clause on the basis of which a termination fee is claimed can be considered a penalty clause. Mitigation of the penalty based on article 6:94 of the Dutch Civil Code? Performance claim rejected; successful appeal to breach of contract; dissolution; restitution claim awarded. Agreement for IT services. Contents of the agreement. No reflex effect of the Door-to-Door Sales Act for small entrepreneurs. Implementation Act of the Consumer Rights Directive. Breach of contract? Unreasonably onerous clause? Cassation: ECLI:NL:HR:2016:996, (Partial) annulment with referral. Final judgment: ECLI:NL:GHSHE:2014:4228 Error. Reflex effect of the unfair commercial practices law? Compelling evidentiary force of written agreement. (No summary provided by court) Proximedia case. No valid defense against the claim concerning a number of monthly invoices. Article 7.1 of the agreement (containing a termination fee) is a general term in the sense of article 6:231 introductory text and under a of the Dutch Civil Code. No "reflex effect" of article 6:237 introductory text and under i of the Dutch Civil Code. Insufficiently argued why article 7.1 would be unreasonably onerous in the sense of article 6:233 of the Dutch Civil Code and that granting the claim would be unacceptable according to standards of reasonableness and fairness. Termination fee is not a penalty in the sense of article 6:91 of the Dutch Civil Code. A retailer (sole proprietorship) is approached by a representative of a company and enters into an "agreement for IT services" with a term of four years, which includes a dissolution fee of 60% of the not yet due monthly payments. The retailer is instructed to prove that, at the time of entering the agreement, the company promised him that he could terminate the agreement without any further obligations if he terminated his business. The retailer is considered to have succeeded in the burden of proof, and the company's claim for payment of the dissolution fee is rejected.
Read more →
Fred, or FRED, was an early chatbot written by Robby Garner. == History == The name Fred was initially suggested by Karen Lindsey, and then Robby jokingly came up with an acronym, "Functional Response Emulation Device." Fred has also been implemented as a Java application by Paco Nathan called JFRED Archived 2008-08-24 at the Wayback Machine. Fred Chatterbot is designed to explore Natural Language communications between people and computer programs. In particular, this is a study of conversation between people and ways that a computer program can learn from other people's conversations to make its own conversations. Fred used a minimalistic "stimulus-response" approach. It worked by storing a database of statements and their responses, and made its own reply by looking up the input statements made by a user and then rendering the corresponding response from the database. This approach simplified the complexity of the rule base, but required expert coding and editing for modifications. Fred was a predecessor to Albert One, which Garner used in 1998 and 1999 to win the Loebner Prize.
Read more →
Pridgen v University of Calgary was freedom of speech case which took place in Alberta, Canada, in 2010. The case deals with two university students, Keith and Steven Pridgen, who were found guilty and punished by the University of Calgary in 2008, on grounds of "non-academic misconduct". The University of Calgary defines "non-academic misconduct" as:(a) conduct which causes injury to a person and/or damage to University property and/or the property of any member of the University community; (b) unauthorized removal and/or unauthorized possession of University property; and (c) conduct which seriously disrupts the lawful educational and related activities of other students and/or University staff.The Court of the Queen's Bench of Alberta found the University of Calgary to be wrong in prosecuting ten students, including the Pridgen brothers, in regards to comments made about a professor on Facebook. The key ruling in this case was that the universities are not exempt from, and that these students were in fact protected under, section 2(b) of the Charter of Rights and Freedoms. This case is notable as it highlights the jurisdiction of the Charter in terms of both new media technologies and university institutions in Canada. == Background == Keith and Steven Pridgen were undergraduate students at the University of Calgary in 2008. The twin brothers shared a Law and Society class being taught by Aruna Mitra. Professor Mitra was teaching this class for the first time in her career, and many of the students were very critical of her knowledge of the course. A Facebook page entitled “I NO Longer Fear Hell, I Took a Course with Aruna Mitra” was created, and many students began posting comments. In particular, Steven Pridgen's comment on November 13, 2007, read: “Somehow I think she just got lazy and gave everybody a 65....that's what I got. Does anybody know how to apply to have it remarked?” Many students had similar concerns to Pridgen's and after having their work re-marked, a number of them did in fact receive higher grades. Keith Pridgen also commented on August 26, 2008: “Hey fellow LWSO. Homees.. So I am quite sure Mitra is NO LONGER TEACHING ANY COURSES WITH THE U OF C !!!!! Remember when she told us she was a long-term professor? Well, Actually she was only sessional and picked up our class at the last moment because another prof wasn't able to do it ...lucky us. Well, anyways I think we should all congratulate ourselves for leaving a Mitra-free legacy for future students!” On September 4, 2008, Aruna Mitra complained about the Facebook page to the Interim Dean of the Faculty of Communication and Culture at the University of Calgary. Dean Tettey called a meeting for the ten students who posted material about Mitra on the Facebook page. The meeting took place on September 18, 2008, and included four professors from the department as well as the Dean. At this meeting, all ten students, including the Pridgen brothers, were found guilty of non-academic misconduct. On November 20, 2008, the Appellant's received a letter from Dean Tettey advising them that their comments “clearly caused unwarranted professional and personal injury to Prof. Mitra and clearly meets the criteria for non-academic misconduct as outlined in the University of Calgary Calendar”. Keith Pridgen was put on probation for 24 months, and both brothers were required to write a letter of apology to Prof. Mitra and refrain from posting or circulating defamatory material regarding any faculty members of the University of Calgary. The Pridgen brothers appealed the decision to the University of Calgary Review Committee and later to the Board of Governors of the University of Calgary however neither of these attempts succeeded in having the decision overturned. == Opinion of the Court == Eight main issues to be determined were laid out by the Honourable Madam Justice J. Strekaf: (a) Does the Charter apply to the disciplinary proceedings taken by the Respondent; (b) If, so were the Applicants' Charter rights infringed; (c) Were the actions taken by the University ultra vires the jurisdiction of the Province of Alberta; (d) Did the Board of Governors err in refusing to hear the Applicants appeals; (e) Were the Applicants' denied a fair hearing; (f) Did the Review Committee provide adequate reasons for its decisions; (g) Did the Review Committee err in concluding that the activities of the Applicants constituted non-academic misconduct; and (h) What, if any, remedy should be granted to the Applicants. The Court determined from previous cases that "a non-government entity may still be subject to the Charter of Rights and freedoms when implementing a specific government policy or program". Justice Strekaf distinguished that the University was acting as agent of the provincial government in providing accessible post-secondary education services to students in Alberta pursuant to the provisions of the PSL Act. Justice Strekaf felt there was sufficient evidence to show that universities in Alberta have some level of reliance on government funds and therefore they are not a "Charter free zone". Justice Strekaf concluded that comments made by Keith and Steven Pridgen, regarding Professor Mitra, on Facebook did not constitute academic misconduct and the Pridgen brothers' right to freedom of expression, under section 2(b) of the Charter, was infringed by the University of Calgary Review Committee.
Read more →
Pridgen v University of Calgary was freedom of speech case which took place in Alberta, Canada, in 2010. The case deals with two university students, Keith and Steven Pridgen, who were found guilty and punished by the University of Calgary in 2008, on grounds of "non-academic misconduct". The University of Calgary defines "non-academic misconduct" as:(a) conduct which causes injury to a person and/or damage to University property and/or the property of any member of the University community; (b) unauthorized removal and/or unauthorized possession of University property; and (c) conduct which seriously disrupts the lawful educational and related activities of other students and/or University staff.The Court of the Queen's Bench of Alberta found the University of Calgary to be wrong in prosecuting ten students, including the Pridgen brothers, in regards to comments made about a professor on Facebook. The key ruling in this case was that the universities are not exempt from, and that these students were in fact protected under, section 2(b) of the Charter of Rights and Freedoms. This case is notable as it highlights the jurisdiction of the Charter in terms of both new media technologies and university institutions in Canada. == Background == Keith and Steven Pridgen were undergraduate students at the University of Calgary in 2008. The twin brothers shared a Law and Society class being taught by Aruna Mitra. Professor Mitra was teaching this class for the first time in her career, and many of the students were very critical of her knowledge of the course. A Facebook page entitled “I NO Longer Fear Hell, I Took a Course with Aruna Mitra” was created, and many students began posting comments. In particular, Steven Pridgen's comment on November 13, 2007, read: “Somehow I think she just got lazy and gave everybody a 65....that's what I got. Does anybody know how to apply to have it remarked?” Many students had similar concerns to Pridgen's and after having their work re-marked, a number of them did in fact receive higher grades. Keith Pridgen also commented on August 26, 2008: “Hey fellow LWSO. Homees.. So I am quite sure Mitra is NO LONGER TEACHING ANY COURSES WITH THE U OF C !!!!! Remember when she told us she was a long-term professor? Well, Actually she was only sessional and picked up our class at the last moment because another prof wasn't able to do it ...lucky us. Well, anyways I think we should all congratulate ourselves for leaving a Mitra-free legacy for future students!” On September 4, 2008, Aruna Mitra complained about the Facebook page to the Interim Dean of the Faculty of Communication and Culture at the University of Calgary. Dean Tettey called a meeting for the ten students who posted material about Mitra on the Facebook page. The meeting took place on September 18, 2008, and included four professors from the department as well as the Dean. At this meeting, all ten students, including the Pridgen brothers, were found guilty of non-academic misconduct. On November 20, 2008, the Appellant's received a letter from Dean Tettey advising them that their comments “clearly caused unwarranted professional and personal injury to Prof. Mitra and clearly meets the criteria for non-academic misconduct as outlined in the University of Calgary Calendar”. Keith Pridgen was put on probation for 24 months, and both brothers were required to write a letter of apology to Prof. Mitra and refrain from posting or circulating defamatory material regarding any faculty members of the University of Calgary. The Pridgen brothers appealed the decision to the University of Calgary Review Committee and later to the Board of Governors of the University of Calgary however neither of these attempts succeeded in having the decision overturned. == Opinion of the Court == Eight main issues to be determined were laid out by the Honourable Madam Justice J. Strekaf: (a) Does the Charter apply to the disciplinary proceedings taken by the Respondent; (b) If, so were the Applicants' Charter rights infringed; (c) Were the actions taken by the University ultra vires the jurisdiction of the Province of Alberta; (d) Did the Board of Governors err in refusing to hear the Applicants appeals; (e) Were the Applicants' denied a fair hearing; (f) Did the Review Committee provide adequate reasons for its decisions; (g) Did the Review Committee err in concluding that the activities of the Applicants constituted non-academic misconduct; and (h) What, if any, remedy should be granted to the Applicants. The Court determined from previous cases that "a non-government entity may still be subject to the Charter of Rights and freedoms when implementing a specific government policy or program". Justice Strekaf distinguished that the University was acting as agent of the provincial government in providing accessible post-secondary education services to students in Alberta pursuant to the provisions of the PSL Act. Justice Strekaf felt there was sufficient evidence to show that universities in Alberta have some level of reliance on government funds and therefore they are not a "Charter free zone". Justice Strekaf concluded that comments made by Keith and Steven Pridgen, regarding Professor Mitra, on Facebook did not constitute academic misconduct and the Pridgen brothers' right to freedom of expression, under section 2(b) of the Charter, was infringed by the University of Calgary Review Committee.
Read more →